HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem iinss 2025
Description: Subset implication for an indexed intersection.
Assertion
Ref Expression
iinss (∃xA BCxA BC)
Distinct variable group(s):   x,C   x,A

Proof of Theorem iinss
StepHypRef Expression
1 19.12 729 . . . 4 (∃xy(xA ∧ (yByC)) → ∀yx(xA ∧ (yByC)))
2 df-rex 1206 . . . . 5 (∃xAy(yByC) ↔ ∃x(xA ∧ ∀y(yByC)))
3 19.28v 957 . . . . . 6 (∀y(xA ∧ (yByC)) ↔ (xA ∧ ∀y(yByC)))
43biex 733 . . . . 5 (∃xy(xA ∧ (yByC)) ↔ ∃x(xA ∧ ∀y(yByC)))
52, 4bitr4 154 . . . 4 (∃xAy(yByC) ↔ ∃xy(xA ∧ (yByC)))
6 df-rex 1206 . . . . 5 (∃xA (yByC) ↔ ∃x(xA ∧ (yByC)))
76bial 695 . . . 4 (∀yxA (yByC) ↔ ∀yx(xA ∧ (yByC)))
81, 5, 73imtr4 192 . . 3 (∃xAy(yByC) → ∀yxA (yByC))
9 r19.36av 1299 . . . . 5 (∃xA (yByC) → (∀xA yByC))
10 visset 1350 . . . . . 6 yV
11 eliin 1999 . . . . . 6 (yV → (yxA B ↔ ∀xA yB))
1210, 11ax-mp 6 . . . . 5 (yxA B ↔ ∀xA yB)
139, 12syl5ib 181 . . . 4 (∃xA (yByC) → (yxA ByC))
141319.20i 691 . . 3 (∀yxA (yByC) → ∀y(yxA ByC))
158, 14syl 12 . 2 (∃xAy(yByC) → ∀y(yxA ByC))
16 dfss2 1497 . . 3 (BC ↔ ∀y(yByC))
1716birex 1224 . 2 (∃xA BC ↔ ∃xAy(yByC))
18 dfss2 1497 . 2 (xA BC ↔ ∀y(yxA ByC))
1915, 17, 183imtr4 192 1 (∃xA BCxA BC)
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196  ∀wal 672  ∃wex 678   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202  Vcvv 1348   ⊆ wss 1487  ciin 1995
This theorem is referenced by:  scott0 3542
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-in 1491  df-ss 1492  df-iin 1997
metamath.org