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

Theorem unfiOLD 9011
Description: Obsolete version of unfi 8917 as of 7-Aug-2024. (Contributed by NM, 16-Nov-2002.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
unfiOLD ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴𝐵) ∈ Fin)

Proof of Theorem unfiOLD
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 diffi 8979 . 2 (𝐵 ∈ Fin → (𝐵𝐴) ∈ Fin)
2 reeanv 3292 . . . 4 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) ↔ (∃𝑥 ∈ ω 𝐴𝑥 ∧ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦))
3 isfi 8719 . . . . 5 (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴𝑥)
4 isfi 8719 . . . . 5 ((𝐵𝐴) ∈ Fin ↔ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦)
53, 4anbi12i 626 . . . 4 ((𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin) ↔ (∃𝑥 ∈ ω 𝐴𝑥 ∧ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦))
62, 5bitr4i 277 . . 3 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) ↔ (𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin))
7 nnacl 8404 . . . . 5 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝑥 +o 𝑦) ∈ ω)
8 unfilem3 9010 . . . . . . 7 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → 𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥))
9 entr 8747 . . . . . . . 8 (((𝐵𝐴) ≈ 𝑦𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥))
109expcom 413 . . . . . . 7 (𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥) → ((𝐵𝐴) ≈ 𝑦 → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)))
118, 10syl 17 . . . . . 6 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐵𝐴) ≈ 𝑦 → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)))
12 disjdif 4402 . . . . . . . 8 (𝐴 ∩ (𝐵𝐴)) = ∅
13 disjdif 4402 . . . . . . . 8 (𝑥 ∩ ((𝑥 +o 𝑦) ∖ 𝑥)) = ∅
14 unen 8790 . . . . . . . 8 (((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) ∧ ((𝐴 ∩ (𝐵𝐴)) = ∅ ∧ (𝑥 ∩ ((𝑥 +o 𝑦) ∖ 𝑥)) = ∅)) → (𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)))
1512, 13, 14mpanr12 701 . . . . . . 7 ((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)))
16 undif2 4407 . . . . . . . . 9 (𝐴 ∪ (𝐵𝐴)) = (𝐴𝐵)
1716a1i 11 . . . . . . . 8 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ∪ (𝐵𝐴)) = (𝐴𝐵))
18 nnaword1 8422 . . . . . . . . 9 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → 𝑥 ⊆ (𝑥 +o 𝑦))
19 undif 4412 . . . . . . . . 9 (𝑥 ⊆ (𝑥 +o 𝑦) ↔ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) = (𝑥 +o 𝑦))
2018, 19sylib 217 . . . . . . . 8 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) = (𝑥 +o 𝑦))
2117, 20breq12d 5083 . . . . . . 7 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) ↔ (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2215, 21syl5ib 243 . . . . . 6 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2311, 22sylan2d 604 . . . . 5 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
24 breq2 5074 . . . . . . 7 (𝑧 = (𝑥 +o 𝑦) → ((𝐴𝐵) ≈ 𝑧 ↔ (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2524rspcev 3552 . . . . . 6 (((𝑥 +o 𝑦) ∈ ω ∧ (𝐴𝐵) ≈ (𝑥 +o 𝑦)) → ∃𝑧 ∈ ω (𝐴𝐵) ≈ 𝑧)
26 isfi 8719 . . . . . 6 ((𝐴𝐵) ∈ Fin ↔ ∃𝑧 ∈ ω (𝐴𝐵) ≈ 𝑧)
2725, 26sylibr 233 . . . . 5 (((𝑥 +o 𝑦) ∈ ω ∧ (𝐴𝐵) ≈ (𝑥 +o 𝑦)) → (𝐴𝐵) ∈ Fin)
287, 23, 27syl6an 680 . . . 4 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ∈ Fin))
2928rexlimivv 3220 . . 3 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ∈ Fin)
306, 29sylbir 234 . 2 ((𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin) → (𝐴𝐵) ∈ Fin)
311, 30sylan2 592 1 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴𝐵) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  wrex 3064  cdif 3880  cun 3881  cin 3882  wss 3883  c0 4253   class class class wbr 5070  (class class class)co 7255  ωcom 7687   +o coa 8264  cen 8688  Fincfn 8691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-oadd 8271  df-er 8456  df-en 8692  df-fin 8695
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator