![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sbthlemi10 | GIF version |
Description: Lemma for isbth 6863. (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 6652 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵) |
3 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
4 | 3 | brdom 6652 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 ↔ ∃𝑔 𝑔:𝐵–1-1→𝐴) |
5 | 2, 4 | anbi12i 456 | . . . 4 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) |
6 | eeanv 1905 | . . . 4 ⊢ (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴)) | |
7 | 5, 6 | bitr4i 186 | . . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ ∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴)) |
8 | sbthlem.3 | . . . . . . 7 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
9 | vex 2692 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
10 | 9 | resex 4868 | . . . . . . . 8 ⊢ (𝑓 ↾ ∪ 𝐷) ∈ V |
11 | vex 2692 | . . . . . . . . . 10 ⊢ 𝑔 ∈ V | |
12 | 11 | cnvex 5085 | . . . . . . . . 9 ⊢ ◡𝑔 ∈ V |
13 | 12 | resex 4868 | . . . . . . . 8 ⊢ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ∈ V |
14 | 10, 13 | unex 4370 | . . . . . . 7 ⊢ ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∈ V |
15 | 8, 14 | eqeltri 2213 | . . . . . 6 ⊢ 𝐻 ∈ V |
16 | sbthlem.2 | . . . . . . 7 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
17 | 3, 16, 8 | sbthlemi9 6861 | . . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵) |
18 | f1oen3g 6656 | . . . . . 6 ⊢ ((𝐻 ∈ V ∧ 𝐻:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵) | |
19 | 15, 17, 18 | sylancr 411 | . . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵) |
20 | 19 | 3expib 1185 | . . . 4 ⊢ (EXMID → ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
21 | 20 | exlimdvv 1870 | . . 3 ⊢ (EXMID → (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)) |
22 | 7, 21 | syl5bi 151 | . 2 ⊢ (EXMID → ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) → 𝐴 ≈ 𝐵)) |
23 | 22 | imp 123 | 1 ⊢ ((EXMID ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴)) → 𝐴 ≈ 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 963 = wceq 1332 ∃wex 1469 ∈ wcel 1481 {cab 2126 Vcvv 2689 ∖ cdif 3073 ∪ cun 3074 ⊆ wss 3076 ∪ cuni 3744 class class class wbr 3937 EXMIDwem 4126 ◡ccnv 4546 ↾ cres 4549 “ cima 4550 –1-1→wf1 5128 –1-1-onto→wf1o 5130 ≈ cen 6640 ≼ cdom 6641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 |
This theorem depends on definitions: df-bi 116 df-stab 817 df-dc 821 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-rab 2426 df-v 2691 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-exmid 4127 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-en 6643 df-dom 6644 |
This theorem is referenced by: isbth 6863 |
Copyright terms: Public domain | W3C validator |