| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbthlemi10 | GIF version | ||
| Description: Lemma for isbth 7284. (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 7034 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| 3 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 4 | 3 | brdom 7034 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 ↔ ∃𝑔 𝑔:𝐵–1-1→𝐴) |
| 5 | 2, 4 | anbi12i 464 | . . . 4 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) |
| 6 | eeanv 1992 | . . . 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 2824 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 10 | 9 | resex 5104 | . . . . . . . 8 ⊢ (𝑓 ↾ ∪ 𝐷) ∈ V |
| 11 | vex 2824 | . . . . . . . . . 10 ⊢ 𝑔 ∈ V | |
| 12 | 11 | cnvex 5326 | . . . . . . . . 9 ⊢ ◡𝑔 ∈ V |
| 13 | 12 | resex 5104 | . . . . . . . 8 ⊢ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ∈ V |
| 14 | 10, 13 | unex 4587 | . . . . . . 7 ⊢ ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∈ V |
| 15 | 8, 14 | eqeltri 2311 | . . . . . 6 ⊢ 𝐻 ∈ V |
| 16 | sbthlem.2 | . . . . . . 7 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
| 17 | 3, 16, 8 | sbthlemi9 7282 | . . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵) |
| 18 | f1oen3g 7040 | . . . . . 6 ⊢ ((𝐻 ∈ V ∧ 𝐻:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵) | |
| 19 | 15, 17, 18 | sylancr 418 | . . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵) |
| 20 | 19 | 3expib 1237 | . . . 4 ⊢ (EXMID → ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
| 21 | 20 | exlimdvv 1953 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 {cab 2224 Vcvv 2821 ∖ cdif 3217 ∪ cun 3218 ⊆ wss 3220 ∪ cuni 3935 class class class wbr 4130 EXMIDwem 4331 ◡ccnv 4773 ↾ cres 4776 “ cima 4777 –1-1→wf1 5374 –1-1-onto→wf1o 5376 ≈ cen 7020 ≼ cdom 7021 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 |
| This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-exmid 4332 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-en 7023 df-dom 7024 |
| This theorem is used by: isbth 7284 |
| Copyright terms: Public domain | W3C validator |