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

Theorem unfiOLD 9051
Description: Obsolete version of unfi 8929 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 8936 . 2 (𝐵 ∈ Fin → (𝐵𝐴) ∈ Fin)
2 reeanv 3295 . . . 4 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) ↔ (∃𝑥 ∈ ω 𝐴𝑥 ∧ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦))
3 isfi 8739 . . . . 5 (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴𝑥)
4 isfi 8739 . . . . 5 ((𝐵𝐴) ∈ Fin ↔ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦)
53, 4anbi12i 627 . . . 4 ((𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin) ↔ (∃𝑥 ∈ ω 𝐴𝑥 ∧ ∃𝑦 ∈ ω (𝐵𝐴) ≈ 𝑦))
62, 5bitr4i 277 . . 3 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) ↔ (𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin))
7 nnacl 8419 . . . . 5 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝑥 +o 𝑦) ∈ ω)
8 unfilem3 9050 . . . . . . 7 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → 𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥))
9 entr 8767 . . . . . . . 8 (((𝐵𝐴) ≈ 𝑦𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥))
109expcom 414 . . . . . . 7 (𝑦 ≈ ((𝑥 +o 𝑦) ∖ 𝑥) → ((𝐵𝐴) ≈ 𝑦 → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)))
118, 10syl 17 . . . . . 6 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐵𝐴) ≈ 𝑦 → (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)))
12 disjdif 4411 . . . . . . . 8 (𝐴 ∩ (𝐵𝐴)) = ∅
13 disjdif 4411 . . . . . . . 8 (𝑥 ∩ ((𝑥 +o 𝑦) ∖ 𝑥)) = ∅
14 unen 8811 . . . . . . . 8 (((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) ∧ ((𝐴 ∩ (𝐵𝐴)) = ∅ ∧ (𝑥 ∩ ((𝑥 +o 𝑦) ∖ 𝑥)) = ∅)) → (𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)))
1512, 13, 14mpanr12 702 . . . . . . 7 ((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)))
16 undif2 4416 . . . . . . . . 9 (𝐴 ∪ (𝐵𝐴)) = (𝐴𝐵)
1716a1i 11 . . . . . . . 8 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ∪ (𝐵𝐴)) = (𝐴𝐵))
18 nnaword1 8437 . . . . . . . . 9 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → 𝑥 ⊆ (𝑥 +o 𝑦))
19 undif 4421 . . . . . . . . 9 (𝑥 ⊆ (𝑥 +o 𝑦) ↔ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) = (𝑥 +o 𝑦))
2018, 19sylib 217 . . . . . . . 8 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) = (𝑥 +o 𝑦))
2117, 20breq12d 5092 . . . . . . 7 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ∪ (𝐵𝐴)) ≈ (𝑥 ∪ ((𝑥 +o 𝑦) ∖ 𝑥)) ↔ (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2215, 21syl5ib 243 . . . . . 6 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ ((𝑥 +o 𝑦) ∖ 𝑥)) → (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2311, 22sylan2d 605 . . . . 5 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
24 breq2 5083 . . . . . . 7 (𝑧 = (𝑥 +o 𝑦) → ((𝐴𝐵) ≈ 𝑧 ↔ (𝐴𝐵) ≈ (𝑥 +o 𝑦)))
2524rspcev 3561 . . . . . 6 (((𝑥 +o 𝑦) ∈ ω ∧ (𝐴𝐵) ≈ (𝑥 +o 𝑦)) → ∃𝑧 ∈ ω (𝐴𝐵) ≈ 𝑧)
26 isfi 8739 . . . . . 6 ((𝐴𝐵) ∈ Fin ↔ ∃𝑧 ∈ ω (𝐴𝐵) ≈ 𝑧)
2725, 26sylibr 233 . . . . 5 (((𝑥 +o 𝑦) ∈ ω ∧ (𝐴𝐵) ≈ (𝑥 +o 𝑦)) → (𝐴𝐵) ∈ Fin)
287, 23, 27syl6an 681 . . . 4 ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ∈ Fin))
2928rexlimivv 3223 . . 3 (∃𝑥 ∈ ω ∃𝑦 ∈ ω (𝐴𝑥 ∧ (𝐵𝐴) ≈ 𝑦) → (𝐴𝐵) ∈ Fin)
306, 29sylbir 234 . 2 ((𝐴 ∈ Fin ∧ (𝐵𝐴) ∈ Fin) → (𝐴𝐵) ∈ Fin)
311, 30sylan2 593 1 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴𝐵) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1542  wcel 2110  wrex 3067  cdif 3889  cun 3890  cin 3891  wss 3892  c0 4262   class class class wbr 5079  (class class class)co 7269  ωcom 7701   +o coa 8279  cen 8705  Fincfn 8708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pow 5292  ax-pr 5356  ax-un 7580
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-ral 3071  df-rex 3072  df-reu 3073  df-rab 3075  df-v 3433  df-sbc 3721  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-pss 3911  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4846  df-int 4886  df-iun 4932  df-br 5080  df-opab 5142  df-mpt 5163  df-tr 5197  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6200  df-ord 6267  df-on 6268  df-lim 6269  df-suc 6270  df-iota 6389  df-fun 6433  df-fn 6434  df-f 6435  df-f1 6436  df-fo 6437  df-f1o 6438  df-fv 6439  df-ov 7272  df-oprab 7273  df-mpo 7274  df-om 7702  df-2nd 7819  df-frecs 8082  df-wrecs 8113  df-recs 8187  df-rdg 8226  df-1o 8282  df-oadd 8286  df-er 8473  df-en 8709  df-fin 8712
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator