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

Theorem nnadjuALT 10093
Description: Shorter proof of nnadju 10092 using ax-rep 5218. (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 7805 . . . 4 (𝐴 ∈ ω → 𝐴 ∈ On)
2 nnon 7805 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
3 onadju 10088 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴𝐵))
41, 2, 3syl2an 596 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ≈ (𝐴𝐵))
5 carden2b 9863 . . 3 ((𝐴 +o 𝐵) ≈ (𝐴𝐵) → (card‘(𝐴 +o 𝐵)) = (card‘(𝐴𝐵)))
64, 5syl 17 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴 +o 𝐵)) = (card‘(𝐴𝐵)))
7 nnacl 8529 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω)
8 cardnn 9859 . . 3 ((𝐴 +o 𝐵) ∈ ω → (card‘(𝐴 +o 𝐵)) = (𝐴 +o 𝐵))
97, 8syl 17 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴 +o 𝐵)) = (𝐴 +o 𝐵))
106, 9eqtr3d 2766 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (card‘(𝐴𝐵)) = (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109   class class class wbr 5092  Oncon0 6307  cfv 6482  (class class class)co 7349  ωcom 7799   +o coa 8385  cen 8869  cdju 9794  cardccrd 9831
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 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
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 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-oadd 8392  df-er 8625  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-dju 9797  df-card 9835
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator