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

Theorem oev2 7603
Description: Alternate value of ordinal exponentiation. Compare oev 7594. (Contributed by NM, 2-Jan-2004.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
oev2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)))
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem oev2
StepHypRef Expression
1 oveq12 6659 . . . . . 6 ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴𝑜 𝐵) = (∅ ↑𝑜 ∅))
2 oe0m0 7600 . . . . . 6 (∅ ↑𝑜 ∅) = 1𝑜
31, 2syl6eq 2672 . . . . 5 ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴𝑜 𝐵) = 1𝑜)
4 fveq2 6191 . . . . . . . 8 (𝐵 = ∅ → (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘∅))
5 1on 7567 . . . . . . . . . 10 1𝑜 ∈ On
65elexi 3213 . . . . . . . . 9 1𝑜 ∈ V
76rdg0 7517 . . . . . . . 8 (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘∅) = 1𝑜
84, 7syl6eq 2672 . . . . . . 7 (𝐵 = ∅ → (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) = 1𝑜)
9 inteq 4478 . . . . . . . 8 (𝐵 = ∅ → 𝐵 = ∅)
10 int0 4490 . . . . . . . 8 ∅ = V
119, 10syl6eq 2672 . . . . . . 7 (𝐵 = ∅ → 𝐵 = V)
128, 11ineq12d 3815 . . . . . 6 (𝐵 = ∅ → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵) = (1𝑜 ∩ V))
13 inv1 3970 . . . . . . 7 (1𝑜 ∩ V) = 1𝑜
1413a1i 11 . . . . . 6 (𝐴 = ∅ → (1𝑜 ∩ V) = 1𝑜)
1512, 14sylan9eqr 2678 . . . . 5 ((𝐴 = ∅ ∧ 𝐵 = ∅) → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵) = 1𝑜)
163, 15eqtr4d 2659 . . . 4 ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵))
17 oveq1 6657 . . . . . . 7 (𝐴 = ∅ → (𝐴𝑜 𝐵) = (∅ ↑𝑜 𝐵))
18 oe0m1 7601 . . . . . . . 8 (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ (∅ ↑𝑜 𝐵) = ∅))
1918biimpa 501 . . . . . . 7 ((𝐵 ∈ On ∧ ∅ ∈ 𝐵) → (∅ ↑𝑜 𝐵) = ∅)
2017, 19sylan9eqr 2678 . . . . . 6 (((𝐵 ∈ On ∧ ∅ ∈ 𝐵) ∧ 𝐴 = ∅) → (𝐴𝑜 𝐵) = ∅)
2120an32s 846 . . . . 5 (((𝐵 ∈ On ∧ 𝐴 = ∅) ∧ ∅ ∈ 𝐵) → (𝐴𝑜 𝐵) = ∅)
22 int0el 4508 . . . . . . . 8 (∅ ∈ 𝐵 𝐵 = ∅)
2322ineq2d 3814 . . . . . . 7 (∅ ∈ 𝐵 → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ∅))
24 in0 3968 . . . . . . 7 ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ∅) = ∅
2523, 24syl6eq 2672 . . . . . 6 (∅ ∈ 𝐵 → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵) = ∅)
2625adantl 482 . . . . 5 (((𝐵 ∈ On ∧ 𝐴 = ∅) ∧ ∅ ∈ 𝐵) → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵) = ∅)
2721, 26eqtr4d 2659 . . . 4 (((𝐵 ∈ On ∧ 𝐴 = ∅) ∧ ∅ ∈ 𝐵) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵))
2816, 27oe0lem 7593 . . 3 ((𝐵 ∈ On ∧ 𝐴 = ∅) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵))
29 inteq 4478 . . . . . . . . . 10 (𝐴 = ∅ → 𝐴 = ∅)
3029, 10syl6eq 2672 . . . . . . . . 9 (𝐴 = ∅ → 𝐴 = V)
3130difeq2d 3728 . . . . . . . 8 (𝐴 = ∅ → (V ∖ 𝐴) = (V ∖ V))
32 difid 3948 . . . . . . . 8 (V ∖ V) = ∅
3331, 32syl6eq 2672 . . . . . . 7 (𝐴 = ∅ → (V ∖ 𝐴) = ∅)
3433uneq2d 3767 . . . . . 6 (𝐴 = ∅ → ( 𝐵 ∪ (V ∖ 𝐴)) = ( 𝐵 ∪ ∅))
35 uncom 3757 . . . . . 6 ( 𝐵 ∪ (V ∖ 𝐴)) = ((V ∖ 𝐴) ∪ 𝐵)
36 un0 3967 . . . . . 6 ( 𝐵 ∪ ∅) = 𝐵
3734, 35, 363eqtr3g 2679 . . . . 5 (𝐴 = ∅ → ((V ∖ 𝐴) ∪ 𝐵) = 𝐵)
3837adantl 482 . . . 4 ((𝐵 ∈ On ∧ 𝐴 = ∅) → ((V ∖ 𝐴) ∪ 𝐵) = 𝐵)
3938ineq2d 3814 . . 3 ((𝐵 ∈ On ∧ 𝐴 = ∅) → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ 𝐵))
4028, 39eqtr4d 2659 . 2 ((𝐵 ∈ On ∧ 𝐴 = ∅) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)))
41 oevn0 7595 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐴𝑜 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵))
42 int0el 4508 . . . . . . . . . 10 (∅ ∈ 𝐴 𝐴 = ∅)
4342difeq2d 3728 . . . . . . . . 9 (∅ ∈ 𝐴 → (V ∖ 𝐴) = (V ∖ ∅))
44 dif0 3950 . . . . . . . . 9 (V ∖ ∅) = V
4543, 44syl6eq 2672 . . . . . . . 8 (∅ ∈ 𝐴 → (V ∖ 𝐴) = V)
4645uneq2d 3767 . . . . . . 7 (∅ ∈ 𝐴 → ( 𝐵 ∪ (V ∖ 𝐴)) = ( 𝐵 ∪ V))
47 unv 3971 . . . . . . 7 ( 𝐵 ∪ V) = V
4846, 35, 473eqtr3g 2679 . . . . . 6 (∅ ∈ 𝐴 → ((V ∖ 𝐴) ∪ 𝐵) = V)
4948adantl 482 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐴) → ((V ∖ 𝐴) ∪ 𝐵) = V)
5049ineq2d 3814 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐴) → ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ V))
51 inv1 3970 . . . 4 ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ V) = (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵)
5250, 51syl6req 2673 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐴) → (rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)))
5341, 52eqtrd 2656 . 2 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)))
5440, 53oe0lem 7593 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝑜 𝐵) = ((rec((𝑥 ∈ V ↦ (𝑥 ·𝑜 𝐴)), 1𝑜)‘𝐵) ∩ ((V ∖ 𝐴) ∪ 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  Vcvv 3200  cdif 3571  cun 3572  cin 3573  c0 3915   cint 4475  cmpt 4729  Oncon0 5723  cfv 5888  (class class class)co 6650  reccrdg 7505  1𝑜c1o 7553   ·𝑜 comu 7558  𝑜 coe 7559
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oexp 7566
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator