ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbthlemi10 GIF version

Theorem sbthlemi10 7288
Description: Lemma for isbth 7289. (Contributed by NM, 28-Mar-1998.)
Hypotheses
Ref Expression
sbthlem.1 𝐴 ∈ V
sbthlem.2 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
sbthlem.3 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
sbthlem.4 𝐵 ∈ V
Assertion
Ref Expression
sbthlemi10 ((EXMID ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴)) → 𝐴 ≈ 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓,𝑔   𝑥,𝐻   𝑓,𝑔,𝐴   𝐵,𝑓,𝑔
Allowed substitution hints:   𝐷(𝑓, 𝑔)   𝐻(𝑓, 𝑔)

Proof of Theorem sbthlemi10
StepHypRef Expression
1 sbthlem.4 . . . . . 6 𝐵 ∈ V
21brdom 7038 . . . . 5 (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)
3 sbthlem.1 . . . . . 6 𝐴 ∈ V
43brdom 7038 . . . . 5 (𝐵 ≼ 𝐴 ↔ ∃𝑔 𝑔:𝐵–1-1→𝐴)
52, 4anbi12i 464 . . . 4 ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴))
6 eeanv 1992 . . . 4 (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) ↔ (∃𝑓 𝑓:𝐴–1-1→𝐵 ∧ ∃𝑔 𝑔:𝐵–1-1→𝐴))
75, 6bitr4i 187 . . 3 ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) ↔ ∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴))
8 sbthlem.3 . . . . . . 7 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
9 vex 2824 . . . . . . . . 9 𝑓 ∈ V
109resex 5107 . . . . . . . 8 (𝑓 ↾ ∪ 𝐷) ∈ V
11 vex 2824 . . . . . . . . . 10 𝑔 ∈ V
1211cnvex 5329 . . . . . . . . 9 ◡𝑔 ∈ V
1312resex 5107 . . . . . . . 8 (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ∈ V
1410, 13unex 4589 . . . . . . 7 ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∈ V
158, 14eqeltri 2311 . . . . . 6 𝐻 ∈ V
16 sbthlem.2 . . . . . . 7 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
173, 16, 8sbthlemi9 7287 . . . . . 6 ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵)
18 f1oen3g 7044 . . . . . 6 ((𝐻 ∈ V ∧ 𝐻:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵)
1915, 17, 18sylancr 418 . . . . 5 ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵)
20193expib 1237 . . . 4 (EXMID → ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵))
2120exlimdvv 1953 . . 3 (EXMID → (∃𝑓∃𝑔(𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐴 ≈ 𝐵))
227, 21biimtrid 152 . 2 (EXMID → ((𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐴) → 𝐴 ≈ 𝐵))
2322imp 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 4131  EXMIDwem 4333  ◡ccnv 4775   ↾ cres 4778   “ cima 4779  –1-1→wf1 5377  –1-1-onto→wf1o 5379   ≈ cen 7024   ≼ cdom 7025
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 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580
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 4132  df-opab 4194  df-exmid 4334  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-en 7027  df-dom 7028
This theorem is used by:  isbth  7289
  Copyright terms: Public domain W3C validator