| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbthlemi10 | GIF version | ||
| Description: Lemma for isbth 7250. (Contributed by NM, 28-Mar-1998.) |
| Ref | Expression |
|---|---|
| sbthlem.1 | ⊢ 𝐴 ∈ V |
| sbthlem.2 | ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} |
| sbthlem.3 | ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
| sbthlem.4 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| sbthlemi10 | ⊢ ((EXMID ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴)) → 𝐴 ≈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbthlem.4 | . . . . . 6 ⊢ 𝐵 ∈ V | |
| 2 | 1 | brdom 7000 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| 3 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 4 | 3 | brdom 7000 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 ↔ ∃𝑔 𝑔:𝐵–1-1→𝐴) |
| 5 | 2, 4 | anbi12i 460 | . . . 4 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) |
| 6 | eeanv 1988 | . . . 4 ⊢ (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) | |
| 7 | 5, 6 | bitr4i 187 | . . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ ∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴)) |
| 8 | sbthlem.3 | . . . . . . 7 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
| 9 | vex 2818 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 10 | 9 | resex 5084 | . . . . . . . 8 ⊢ (𝑓 ↾ ∪ 𝐷) ∈ V |
| 11 | vex 2818 | . . . . . . . . . 10 ⊢ 𝑔 ∈ V | |
| 12 | 11 | cnvex 5306 | . . . . . . . . 9 ⊢ ◡𝑔 ∈ V |
| 13 | 12 | resex 5084 | . . . . . . . 8 ⊢ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ∈ V |
| 14 | 10, 13 | unex 4567 | . . . . . . 7 ⊢ ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∈ V |
| 15 | 8, 14 | eqeltri 2307 | . . . . . 6 ⊢ 𝐻 ∈ V |
| 16 | sbthlem.2 | . . . . . . 7 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
| 17 | 3, 16, 8 | sbthlemi9 7248 | . . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵) |
| 18 | f1oen3g 7006 | . . . . . 6 ⊢ ((𝐻 ∈ V ∧ 𝐻:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵) | |
| 19 | 15, 17, 18 | sylancr 414 | . . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵) |
| 20 | 19 | 3expib 1233 | . . . 4 ⊢ (EXMID → ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
| 21 | 20 | exlimdvv 1949 | . . 3 ⊢ (EXMID → (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
| 22 | 7, 21 | biimtrid 152 | . 2 ⊢ (EXMID → ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) → 𝐴 ≈ 𝐵)) |
| 23 | 22 | imp 124 | 1 ⊢ ((EXMID ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴)) → 𝐴 ≈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∃wex 1541 ∈ wcel 2205 {cab 2220 Vcvv 2815 ∖ cdif 3211 ∪ cun 3212 ⊆ wss 3214 ∪ cuni 3919 class class class wbr 4114 EXMIDwem 4312 ◡ccnv 4753 ↾ cres 4756 “ cima 4757 –1-1→wf1 5354 –1-1-onto→wf1o 5356 ≈ cen 6986 ≼ cdom 6987 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 |
| This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-br 4115 df-opab 4177 df-exmid 4313 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-en 6989 df-dom 6990 |
| This theorem is referenced by: isbth 7250 |
| Copyright terms: Public domain | W3C validator |