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

Theorem infunsdom1 10168
Description: The union of two sets that are strictly dominated by the infinite set 𝑋 is also dominated by 𝑋. This version of infunsdom 10169 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 780 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐴𝐵)
2 domsdomtr 9084 . . . . 5 ((𝐴𝐵𝐵 ≺ ω) → 𝐴 ≺ ω)
31, 2sylan 589 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → 𝐴 ≺ ω)
4 unfi2 9254 . . . 4 ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ ω)
53, 4sylancom 597 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ ω)
6 simpllr 785 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → ω ≼ 𝑋)
7 sdomdomtr 9082 . . 3 (((𝐴𝐵) ≺ ω ∧ ω ≼ 𝑋) → (𝐴𝐵) ≺ 𝑋)
85, 6, 7syl2anc 593 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ 𝐵 ≺ ω) → (𝐴𝐵) ≺ 𝑋)
9 omelon 9601 . . . . . 6 ω ∈ On
10 onenon 9907 . . . . . 6 (ω ∈ On → ω ∈ dom card)
119, 10ax-mp 5 . . . . 5 ω ∈ dom card
12 simpll 776 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝑋 ∈ dom card)
13 sdomdom 8961 . . . . . . 7 (𝐵𝑋𝐵𝑋)
1413ad2antll 739 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐵𝑋)
15 numdom 9994 . . . . . 6 ((𝑋 ∈ dom card ∧ 𝐵𝑋) → 𝐵 ∈ dom card)
1612, 14, 15syl2anc 593 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → 𝐵 ∈ dom card)
17 domtri2 9947 . . . . 5 ((ω ∈ dom card ∧ 𝐵 ∈ dom card) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1811, 16, 17sylancr 596 . . . 4 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1918biimpar 481 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ¬ 𝐵 ≺ ω) → ω ≼ 𝐵)
20 uncom 4111 . . . . 5 (𝐴𝐵) = (𝐵𝐴)
2116adantr 484 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐵 ∈ dom card)
22 simpr 488 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → ω ≼ 𝐵)
231adantr 484 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐴𝐵)
24 infunabs 10162 . . . . . 6 ((𝐵 ∈ dom card ∧ ω ≼ 𝐵𝐴𝐵) → (𝐵𝐴) ≈ 𝐵)
2521, 22, 23, 24syl3anc 1390 . . . . 5 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐵𝐴) ≈ 𝐵)
2620, 25eqbrtrid 5135 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐴𝐵) ≈ 𝐵)
27 simplrr 787 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → 𝐵𝑋)
28 ensdomtr 9085 . . . 4 (((𝐴𝐵) ≈ 𝐵𝐵𝑋) → (𝐴𝐵) ≺ 𝑋)
2926, 27, 28syl2anc 593 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ω ≼ 𝐵) → (𝐴𝐵) ≺ 𝑋)
3019, 29syldan 600 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) ∧ ¬ 𝐵 ≺ ω) → (𝐴𝐵) ≺ 𝑋)
318, 30pm2.61dan 822 1 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴𝐵𝐵𝑋)) → (𝐴𝐵) ≺ 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399  wcel 2142  cun 3902   class class class wbr 5100  dom cdm 5647  Oncon0 6346  ωcom 7846  cen 8924  cdom 8925  csdm 8926  cardccrd 9893
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-inf2 9596
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-isom 6530  df-riota 7353  df-ov 7399  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-2o 8438  df-er 8678  df-en 8928  df-dom 8929  df-sdom 8930  df-fin 8931  df-oi 9458  df-dju 9859  df-card 9897
This theorem is referenced by:  infunsdom  10169
  Copyright terms: Public domain W3C validator