| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cplem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for the Collection Principle cp 9865. (Contributed by NM, 17-Oct-2003.) |
| Ref | Expression |
|---|---|
| cplem1.1 | ⊢ 𝐶 = {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝐵 (rank‘𝑦) ⊆ (rank‘𝑧)} |
| cplem1.2 | ⊢ 𝐷 = ∪ 𝑥 ∈ 𝐴 𝐶 |
| Ref | Expression |
|---|---|
| cplem1 | ⊢ ∀𝑥 ∈ 𝐴 (𝐵 ≠ ∅ → (𝐵 ∩ 𝐷) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scott0 9848 | . . . . . 6 ⊢ (𝐵 = ∅ ↔ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝐵 (rank‘𝑦) ⊆ (rank‘𝑧)} = ∅) | |
| 2 | cplem1.1 | . . . . . . 7 ⊢ 𝐶 = {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝐵 (rank‘𝑦) ⊆ (rank‘𝑧)} | |
| 3 | 2 | eqeq1i 2770 | . . . . . 6 ⊢ (𝐶 = ∅ ↔ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝐵 (rank‘𝑦) ⊆ (rank‘𝑧)} = ∅) |
| 4 | 1, 3 | bitr4i 281 | . . . . 5 ⊢ (𝐵 = ∅ ↔ 𝐶 = ∅) |
| 5 | 4 | necon3bii 3012 | . . . 4 ⊢ (𝐵 ≠ ∅ ↔ 𝐶 ≠ ∅) |
| 6 | n0 4308 | . . . 4 ⊢ (𝐶 ≠ ∅ ↔ ∃𝑤 𝑤 ∈ 𝐶) | |
| 7 | 5, 6 | bitri 278 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑤 𝑤 ∈ 𝐶) |
| 8 | 2 | ssrab3 4038 | . . . . . . . 8 ⊢ 𝐶 ⊆ 𝐵 |
| 9 | 8 | sseli 3935 | . . . . . . 7 ⊢ (𝑤 ∈ 𝐶 → 𝑤 ∈ 𝐵) |
| 10 | 9 | a1i 11 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝑤 ∈ 𝐶 → 𝑤 ∈ 𝐵)) |
| 11 | ssiun2 5007 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 12 | cplem1.2 | . . . . . . . 8 ⊢ 𝐷 = ∪ 𝑥 ∈ 𝐴 𝐶 | |
| 13 | 11, 12 | sseqtrrdi 3980 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → 𝐶 ⊆ 𝐷) |
| 14 | 13 | sseld 3938 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝑤 ∈ 𝐶 → 𝑤 ∈ 𝐷)) |
| 15 | 10, 14 | jcad 521 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (𝑤 ∈ 𝐶 → (𝑤 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷))) |
| 16 | inelcm 4422 | . . . . 5 ⊢ ((𝑤 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) → (𝐵 ∩ 𝐷) ≠ ∅) | |
| 17 | 15, 16 | syl6 36 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝑤 ∈ 𝐶 → (𝐵 ∩ 𝐷) ≠ ∅)) |
| 18 | 17 | exlimdv 1956 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (∃𝑤 𝑤 ∈ 𝐶 → (𝐵 ∩ 𝐷) ≠ ∅)) |
| 19 | 7, 18 | biimtrid 245 | . 2 ⊢ (𝑥 ∈ 𝐴 → (𝐵 ≠ ∅ → (𝐵 ∩ 𝐷) ≠ ∅)) |
| 20 | 19 | rgen 3081 | 1 ⊢ ∀𝑥 ∈ 𝐴 (𝐵 ≠ ∅ → (𝐵 ∩ 𝐷) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∃wex 1802 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 {crab 3417 ∩ cin 3906 ⊆ wss 3907 ∅c0 4288 ∪ ciun 4951 ‘cfv 6525 rankcrnk 9723 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-r1 9724 df-rank 9725 |
| This theorem is referenced by: cplem2 9864 |
| Copyright terms: Public domain | W3C validator |