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

Theorem nnadjuALT 10121
Description: Shorter proof of nnadju 10120 using ax-rep 5212. (Contributed by Paul Chapman, 11-Apr-2009.) (Revised by Mario Carneiro, 6-Feb-2013.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
nnadjuALT ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴𝐵)) = (𝐴 +o 𝐵))

Proof of Theorem nnadjuALT
StepHypRef Expression
1 nnon 7823 . . . 4 (𝐴 ∈ ω → 𝐴 ∈ On)
2 nnon 7823 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
3 onadju 10116 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴𝐵))
41, 2, 3syl2an 597 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ≈ (𝐴𝐵))
5 carden2b 9891 . . 3 ((𝐴 +o 𝐵) ≈ (𝐴𝐵) → (card‘(𝐴 +o 𝐵)) = (card‘(𝐴𝐵)))
64, 5syl 17 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴 +o 𝐵)) = (card‘(𝐴𝐵)))
7 nnacl 8547 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω)
8 cardnn 9887 . . 3 ((𝐴 +o 𝐵) ∈ ω → (card‘(𝐴 +o 𝐵)) = (𝐴 +o 𝐵))
97, 8syl 17 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴 +o 𝐵)) = (𝐴 +o 𝐵))
106, 9eqtr3d 2773 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴𝐵)) = (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114   class class class wbr 5085  Oncon0 6323  cfv 6498  (class class class)co 7367  ωcom 7817   +o coa 8402  cen 8890  cdju 9822  cardccrd 9859
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-dju 9825  df-card 9863
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator