| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbthlemi10 | GIF version | ||
| Description: Lemma for isbth 7084. (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 6852 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| 3 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 4 | 3 | brdom 6852 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 ↔ ∃𝑔 𝑔:𝐵–1-1→𝐴) |
| 5 | 2, 4 | anbi12i 460 | . . . 4 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) |
| 6 | eeanv 1961 | . . . 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 2776 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 10 | 9 | resex 5009 | . . . . . . . 8 ⊢ (𝑓 ↾ ∪ 𝐷) ∈ V |
| 11 | vex 2776 | . . . . . . . . . 10 ⊢ 𝑔 ∈ V | |
| 12 | 11 | cnvex 5230 | . . . . . . . . 9 ⊢ ◡𝑔 ∈ V |
| 13 | 12 | resex 5009 | . . . . . . . 8 ⊢ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ∈ V |
| 14 | 10, 13 | unex 4496 | . . . . . . 7 ⊢ ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∈ V |
| 15 | 8, 14 | eqeltri 2279 | . . . . . 6 ⊢ 𝐻 ∈ V |
| 16 | sbthlem.2 | . . . . . . 7 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
| 17 | 3, 16, 8 | sbthlemi9 7082 | . . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵) |
| 18 | f1oen3g 6858 | . . . . . 6 ⊢ ((𝐻 ∈ V ∧ 𝐻:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵) | |
| 19 | 15, 17, 18 | sylancr 414 | . . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵) |
| 20 | 19 | 3expib 1209 | . . . 4 ⊢ (EXMID → ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
| 21 | 20 | exlimdvv 1922 | . . 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 981 = wceq 1373 ∃wex 1516 ∈ wcel 2177 {cab 2192 Vcvv 2773 ∖ cdif 3167 ∪ cun 3168 ⊆ wss 3170 ∪ cuni 3856 class class class wbr 4051 EXMIDwem 4246 ◡ccnv 4682 ↾ cres 4685 “ cima 4686 –1-1→wf1 5277 –1-1-onto→wf1o 5279 ≈ cen 6838 ≼ cdom 6839 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 |
| This theorem depends on definitions: df-bi 117 df-stab 833 df-dc 837 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-br 4052 df-opab 4114 df-exmid 4247 df-id 4348 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-en 6841 df-dom 6842 |
| This theorem is referenced by: isbth 7084 |
| Copyright terms: Public domain | W3C validator |