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

Theorem infunsdom1 10165
Description: The union of two sets that are strictly dominated by the infinite set 𝑋 is also dominated by 𝑋. This version of infunsdom 10166 assumes additionally that 𝐴 is the smaller of the two. (Contributed by Mario Carneiro, 14-Dec-2013.) (Revised by Mario Carneiro, 3-May-2015.)
Assertion
Ref Expression
infunsdom1 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → (𝐴𝐵) ≺ 𝑋)

Proof of Theorem infunsdom1
StepHypRef Expression
1 simprl 770 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐴𝐵)
2 domsdomtr 9076 . . . . 5 ((𝐴𝐵𝐵 ≺ ω) → 𝐴 ≺ ω)
31, 2sylan 580 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → 𝐴 ≺ ω)
4 unfi2 9259 . . . 4 ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ ω)
53, 4sylancom 588 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ ω)
6 simpllr 775 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → ω ≼ 𝑋)
7 sdomdomtr 9074 . . 3 (((𝐴𝐵) ≺ ω ∧ ω ≼ 𝑋) → (𝐴𝐵) ≺ 𝑋)
85, 6, 7syl2anc 584 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ 𝑋)
9 omelon 9599 . . . . . 6 ω ∈ On
10 onenon 9902 . . . . . 6 (ω ∈ On → ω ∈ dom card)
119, 10ax-mp 5 . . . . 5 ω ∈ dom card
12 simpll 766 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝑋 ∈ dom card)
13 sdomdom 8951 . . . . . . 7 (𝐵𝑋𝐵𝑋)
1413ad2antll 729 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐵𝑋)
15 numdom 9991 . . . . . 6 ((𝑋 ∈ dom card ∧ 𝐵𝑋) → 𝐵 ∈ dom card)
1612, 14, 15syl2anc 584 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐵 ∈ dom card)
17 domtri2 9942 . . . . 5 ((ω ∈ dom card ∧ 𝐵 ∈ dom card) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1811, 16, 17sylancr 587 . . . 4 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1918biimpar 477 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ¬ 𝐵 ≺ ω) → ω ≼ 𝐵)
20 uncom 4121 . . . . 5 (𝐴𝐵) = (𝐵𝐴)
2116adantr 480 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐵 ∈ dom card)
22 simpr 484 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → ω ≼ 𝐵)
231adantr 480 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐴𝐵)
24 infunabs 10159 . . . . . 6 ((𝐵 ∈ dom card ∧ ω ≼ 𝐵𝐴𝐵) → (𝐵𝐴) ≈ 𝐵)
2521, 22, 23, 24syl3anc 1373 . . . . 5 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐵𝐴) ≈ 𝐵)
2620, 25eqbrtrid 5142 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐴𝐵) ≈ 𝐵)
27 simplrr 777 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐵𝑋)
28 ensdomtr 9077 . . . 4 (((𝐴𝐵) ≈ 𝐵𝐵𝑋) → (𝐴𝐵) ≺ 𝑋)
2926, 27, 28syl2anc 584 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐴𝐵) ≺ 𝑋)
3019, 29syldan 591 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ¬ 𝐵 ≺ ω) → (𝐴𝐵) ≺ 𝑋)
318, 30pm2.61dan 812 1 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → (𝐴𝐵) ≺ 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wcel 2109  cun 3912   class class class wbr 5107  dom cdm 5638  Oncon0 6332  ωcom 7842  cen 8915  cdom 8916  csdm 8917  cardccrd 9888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-2o 8435  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-oi 9463  df-dju 9854  df-card 9892
This theorem is referenced by:  infunsdom  10166
  Copyright terms: Public domain W3C validator