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

Theorem infunsdom1 10329
Description: The union of two sets that are strictly dominated by the infinite set 𝑋 is also dominated by 𝑋. This version of infunsdom 10330 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 783 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → 𝐴 ≼ 𝐵)
2 domsdomtr 9169 . . . . 5 ((𝐴 ≼ 𝐵 ∧ 𝐵 ≺ ω) → 𝐴 ≺ ω)
31, 2sylan 592 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ 𝐵 ≺ ω) → 𝐴 ≺ ω)
4 unfi2 9340 . . . 4 ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴 ∪ 𝐵) ≺ ω)
53, 4sylancom 600 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ 𝐵 ≺ ω) → (𝐴 ∪ 𝐵) ≺ ω)
6 simpllr 788 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ 𝐵 ≺ ω) → ω ≼ 𝑋)
7 sdomdomtr 9167 . . 3 (((𝐴 ∪ 𝐵) ≺ ω ∧ ω ≼ 𝑋) → (𝐴 ∪ 𝐵) ≺ 𝑋)
85, 6, 7syl2anc 596 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ 𝐵 ≺ ω) → (𝐴 ∪ 𝐵) ≺ 𝑋)
9 omelon 9684 . . . . . 6 ω ∈ On
10 onenon 10067 . . . . . 6 (ω ∈ On → ω ∈ dom card)
119, 10ax-mp 5 . . . . 5 ω ∈ dom card
12 simpll 779 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → 𝑋 ∈ dom card)
13 sdomdom 9045 . . . . . . 7 (𝐵 ≺ 𝑋 → 𝐵 ≼ 𝑋)
1413ad2antll 742 . . . . . 6 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → 𝐵 ≼ 𝑋)
15 numdom 10156 . . . . . 6 ((𝑋 ∈ dom card ∧ 𝐵 ≼ 𝑋) → 𝐵 ∈ dom card)
1612, 14, 15syl2anc 596 . . . . 5 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → 𝐵 ∈ dom card)
17 domtri2 10109 . . . . 5 ((ω ∈ dom card ∧ 𝐵 ∈ dom card) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1811, 16, 17sylancr 599 . . . 4 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → (ω ≼ 𝐵 ↔ ¬ 𝐵 ≺ ω))
1918biimpar 483 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ¬ 𝐵 ≺ ω) → ω ≼ 𝐵)
20 uncom 4160 . . . . 5 (𝐴 ∪ 𝐵) = (𝐵 ∪ 𝐴)
2116adantr 486 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → 𝐵 ∈ dom card)
22 simpr 490 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → ω ≼ 𝐵)
231adantr 486 . . . . . 6 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → 𝐴 ≼ 𝐵)
24 infunabs 10323 . . . . . 6 ((𝐵 ∈ dom card ∧ ω ≼ 𝐵 ∧ 𝐴 ≼ 𝐵) → (𝐵 ∪ 𝐴) ≈ 𝐵)
2521, 22, 23, 24syl3anc 1399 . . . . 5 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → (𝐵 ∪ 𝐴) ≈ 𝐵)
2620, 25eqbrtrid 5146 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → (𝐴 ∪ 𝐵) ≈ 𝐵)
27 simplrr 790 . . . 4 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → 𝐵 ≺ 𝑋)
28 ensdomtr 9170 . . . 4 (((𝐴 ∪ 𝐵) ≈ 𝐵 ∧ 𝐵 ≺ 𝑋) → (𝐴 ∪ 𝐵) ≺ 𝑋)
2926, 27, 28syl2anc 596 . . 3 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ω ≼ 𝐵) → (𝐴 ∪ 𝐵) ≺ 𝑋)
3019, 29syldan 603 . 2 ((((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) ∧ ¬ 𝐵 ≺ ω) → (𝐴 ∪ 𝐵) ≺ 𝑋)
318, 30pm2.61dan 825 1 (((𝑋 ∈ dom card ∧ ω ≼ 𝑋) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝑋)) → (𝐴 ∪ 𝐵) ≺ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147   ∪ cun 4152   class class class wbr 5108  dom cdm 5658  Oncon0 6388  ωcom 7911   ≈ cen 9008   ≼ cdom 9009   ≺ csdm 9010  cardccrd 10053
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-oi 9541  df-dju 10019  df-card 10057
This theorem is used by:  infunsdom  10330
  Copyright terms: Public domain W3C validator