MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbthfi Structured version   Visualization version   GIF version

Theorem sbthfi 8916
Description: Schroeder-Bernstein Theorem for finite sets, proved without using the Axiom of Power Sets (unlike sbth 8810). (Contributed by BTernaryTau, 4-Nov-2024.)
Assertion
Ref Expression
sbthfi ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵)

Proof of Theorem sbthfi
Dummy variables 𝑤 𝑧 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reldom 8674 . . . . 5 Rel ≼
21brrelex1i 5633 . . . 4 (𝐴𝐵𝐴 ∈ V)
31brrelex1i 5633 . . . 4 (𝐵𝐴𝐵 ∈ V)
4 breq1 5073 . . . . . . 7 (𝑧 = 𝐴 → (𝑧𝑤𝐴𝑤))
5 breq2 5074 . . . . . . 7 (𝑧 = 𝐴 → (𝑤𝑧𝑤𝐴))
64, 53anbi23d 1441 . . . . . 6 (𝑧 = 𝐴 → ((𝑤 ∈ Fin ∧ 𝑧𝑤𝑤𝑧) ↔ (𝑤 ∈ Fin ∧ 𝐴𝑤𝑤𝐴)))
7 breq1 5073 . . . . . 6 (𝑧 = 𝐴 → (𝑧𝑤𝐴𝑤))
86, 7imbi12d 348 . . . . 5 (𝑧 = 𝐴 → (((𝑤 ∈ Fin ∧ 𝑧𝑤𝑤𝑧) → 𝑧𝑤) ↔ ((𝑤 ∈ Fin ∧ 𝐴𝑤𝑤𝐴) → 𝐴𝑤)))
9 eleq1 2827 . . . . . . 7 (𝑤 = 𝐵 → (𝑤 ∈ Fin ↔ 𝐵 ∈ Fin))
10 breq2 5074 . . . . . . 7 (𝑤 = 𝐵 → (𝐴𝑤𝐴𝐵))
11 breq1 5073 . . . . . . 7 (𝑤 = 𝐵 → (𝑤𝐴𝐵𝐴))
129, 10, 113anbi123d 1438 . . . . . 6 (𝑤 = 𝐵 → ((𝑤 ∈ Fin ∧ 𝐴𝑤𝑤𝐴) ↔ (𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴)))
13 breq2 5074 . . . . . 6 (𝑤 = 𝐵 → (𝐴𝑤𝐴𝐵))
1412, 13imbi12d 348 . . . . 5 (𝑤 = 𝐵 → (((𝑤 ∈ Fin ∧ 𝐴𝑤𝑤𝐴) → 𝐴𝑤) ↔ ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵)))
15 vex 3427 . . . . . 6 𝑧 ∈ V
16 sseq1 3943 . . . . . . . 8 (𝑦 = 𝑥 → (𝑦𝑧𝑥𝑧))
17 imaeq2 5953 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑓𝑦) = (𝑓𝑥))
1817difeq2d 4054 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑤 ∖ (𝑓𝑦)) = (𝑤 ∖ (𝑓𝑥)))
1918imaeq2d 5957 . . . . . . . . 9 (𝑦 = 𝑥 → (𝑔 “ (𝑤 ∖ (𝑓𝑦))) = (𝑔 “ (𝑤 ∖ (𝑓𝑥))))
20 difeq2 4048 . . . . . . . . 9 (𝑦 = 𝑥 → (𝑧𝑦) = (𝑧𝑥))
2119, 20sseq12d 3951 . . . . . . . 8 (𝑦 = 𝑥 → ((𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦) ↔ (𝑔 “ (𝑤 ∖ (𝑓𝑥))) ⊆ (𝑧𝑥)))
2216, 21anbi12d 634 . . . . . . 7 (𝑦 = 𝑥 → ((𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦)) ↔ (𝑥𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑥))) ⊆ (𝑧𝑥))))
2322cbvabv 2813 . . . . . 6 {𝑦 ∣ (𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦))} = {𝑥 ∣ (𝑥𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑥))) ⊆ (𝑧𝑥))}
24 eqid 2739 . . . . . 6 ((𝑓 {𝑦 ∣ (𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦))}) ∪ (𝑔 ↾ (𝑧 {𝑦 ∣ (𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦))}))) = ((𝑓 {𝑦 ∣ (𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦))}) ∪ (𝑔 ↾ (𝑧 {𝑦 ∣ (𝑦𝑧 ∧ (𝑔 “ (𝑤 ∖ (𝑓𝑦))) ⊆ (𝑧𝑦))})))
25 vex 3427 . . . . . 6 𝑤 ∈ V
2615, 23, 24, 25sbthfilem 8915 . . . . 5 ((𝑤 ∈ Fin ∧ 𝑧𝑤𝑤𝑧) → 𝑧𝑤)
278, 14, 26vtocl2g 3501 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵))
282, 3, 27syl2an 599 . . 3 ((𝐴𝐵𝐵𝐴) → ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵))
29283adant1 1132 . 2 ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵))
3029pm2.43i 52 1 ((𝐵 ∈ Fin ∧ 𝐴𝐵𝐵𝐴) → 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2112  {cab 2716  Vcvv 3423  cdif 3881  cun 3882  wss 3884   cuni 4836   class class class wbr 5070  ccnv 5578  cres 5581  cima 5582  cen 8665  cdom 8666  Fincfn 8668
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2710  ax-sep 5216  ax-nul 5223  ax-pr 5346  ax-un 7563
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2818  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3071  df-rab 3073  df-v 3425  df-sbc 3713  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4255  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5186  df-id 5479  df-eprel 5485  df-po 5493  df-so 5494  df-fr 5534  df-we 5536  df-xp 5585  df-rel 5586  df-cnv 5587  df-co 5588  df-dm 5589  df-rn 5590  df-res 5591  df-ima 5592  df-ord 6251  df-on 6252  df-lim 6253  df-suc 6254  df-iota 6373  df-fun 6417  df-fn 6418  df-f 6419  df-f1 6420  df-fo 6421  df-f1o 6422  df-fv 6423  df-om 7685  df-1o 8244  df-en 8669  df-dom 8670  df-fin 8672
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator