| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Lemma for the Collection Principle cp 3547. |
| Ref | Expression |
|---|---|
| cplem1.1 | ⊢ C = {y ∈ B∣∀z ∈ B (rank ‘y) ⊆ (rank ‘z)} |
| cplem1.2 | ⊢ D = ∪x ∈ A C |
| Ref | Expression |
|---|---|
| cplem1 | ⊢ ∀x ∈ A (¬ B = ∅ → ¬ (B ∩ D) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cplem1.1 | . . . . . . . . 9 ⊢ C = {y ∈ B∣∀z ∈ B (rank ‘y) ⊆ (rank ‘z)} | |
| 2 | ssrab 1556 | . . . . . . . . 9 ⊢ {y ∈ B∣∀z ∈ B (rank ‘y) ⊆ (rank ‘z)} ⊆ B | |
| 3 | 1, 2 | eqsstr 1530 | . . . . . . . 8 ⊢ C ⊆ B |
| 4 | 3 | sseli 1504 | . . . . . . 7 ⊢ (w ∈ C → w ∈ B) |
| 5 | 4 | a1i 7 | . . . . . 6 ⊢ (x ∈ A → (w ∈ C → w ∈ B)) |
| 6 | ssiun2 2019 | . . . . . . . 8 ⊢ (x ∈ A → C ⊆ ∪x ∈ A C) | |
| 7 | cplem1.2 | . . . . . . . 8 ⊢ D = ∪x ∈ A C | |
| 8 | 6, 7 | syl6ssr 1547 | . . . . . . 7 ⊢ (x ∈ A → C ⊆ D) |
| 9 | 8 | sseld 1506 | . . . . . 6 ⊢ (x ∈ A → (w ∈ C → w ∈ D)) |
| 10 | 5, 9 | jcad 455 | . . . . 5 ⊢ (x ∈ A → (w ∈ C → (w ∈ B ∧ w ∈ D))) |
| 11 | inelcm 1742 | . . . . 5 ⊢ ((w ∈ B ∧ w ∈ D) → ¬ (B ∩ D) = ∅) | |
| 12 | 10, 11 | syl6 23 | . . . 4 ⊢ (x ∈ A → (w ∈ C → ¬ (B ∩ D) = ∅)) |
| 13 | 12 | 19.23adv 954 | . . 3 ⊢ (x ∈ A → (∃w w ∈ C → ¬ (B ∩ D) = ∅)) |
| 14 | scott0 3542 | . . . . . 6 ⊢ (B = ∅ ↔ {y ∈ B∣∀z ∈ B (rank ‘y) ⊆ (rank ‘z)} = ∅) | |
| 15 | 1 | cleq1i 1108 | . . . . . 6 ⊢ (C = ∅ ↔ {y ∈ B∣∀z ∈ B (rank ‘y) ⊆ (rank ‘z)} = ∅) |
| 16 | 14, 15 | bitr4 154 | . . . . 5 ⊢ (B = ∅ ↔ C = ∅) |
| 17 | 16 | negbii 162 | . . . 4 ⊢ (¬ B = ∅ ↔ ¬ C = ∅) |
| 18 | n0 1714 | . . . 4 ⊢ (¬ C = ∅ ↔ ∃w w ∈ C) | |
| 19 | 17, 18 | bitr 151 | . . 3 ⊢ (¬ B = ∅ ↔ ∃w w ∈ C) |
| 20 | 13, 19 | syl5ib 181 | . 2 ⊢ (x ∈ A → (¬ B = ∅ → ¬ (B ∩ D) = ∅)) |
| 21 | 20 | rgen 1247 | 1 ⊢ ∀x ∈ A (¬ B = ∅ → ¬ (B ∩ D) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 → wi 2 ∧ wa 196 ∃wex 678 = wceq 1091 ∈ wcel 1092 ∀wral 1201 {crab 1204 ∩ cin 1486 ⊆ wss 1487 ∅c0 1707 ∪ciun 1994 ‘cfv 2422 rankcrnk 3486 |
| This theorem is referenced by: cplem2 3546 |
| 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-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 ax-inf 1079 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ne 1192 df-ral 1205 df-rex 1206 df-rab 1208 df-v 1349 df-sbc 1441 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-pss 1494 df-nul 1708 df-if 1777 df-pw 1799 df-sn 1811 df-pr 1812 df-tp 1814 df-op 1815 df-uni 1920 df-int 1966 df-iun 1996 df-iin 1997 df-tr 2042 df-br 2063 df-opab 2098 df-eprel 2122 df-id 2125 df-po 2128 df-so 2138 df-fr 2169 df-we 2186 df-ord 2202 df-on 2203 df-lim 2204 df-suc 2205 df-om 2373 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fv 2438 df-rdg 2970 df-r1 3487 df-rank 3488 |