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

Theorem oef1o 9386
Description: A bijection of the base sets induces a bijection on ordinal exponentials. (The assumption (𝐹‘∅) = ∅ can be discharged using fveqf1o 7155.) (Contributed by Mario Carneiro, 30-May-2015.) (Revised by AV, 3-Jul-2019.)
Hypotheses
Ref Expression
oef1o.f (𝜑𝐹:𝐴1-1-onto𝐶)
oef1o.g (𝜑𝐺:𝐵1-1-onto𝐷)
oef1o.a (𝜑𝐴 ∈ (On ∖ 1o))
oef1o.b (𝜑𝐵 ∈ On)
oef1o.c (𝜑𝐶 ∈ On)
oef1o.d (𝜑𝐷 ∈ On)
oef1o.z (𝜑 → (𝐹‘∅) = ∅)
oef1o.k 𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺)))
oef1o.h 𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵))
Assertion
Ref Expression
oef1o (𝜑𝐻:(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝜑,𝑥,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦
Allowed substitution hints:   𝐻(𝑥,𝑦)   𝐾(𝑥,𝑦)

Proof of Theorem oef1o
StepHypRef Expression
1 eqid 2738 . . . . 5 dom (𝐶 CNF 𝐷) = dom (𝐶 CNF 𝐷)
2 oef1o.c . . . . 5 (𝜑𝐶 ∈ On)
3 oef1o.d . . . . 5 (𝜑𝐷 ∈ On)
41, 2, 3cantnff1o 9384 . . . 4 (𝜑 → (𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶o 𝐷))
5 eqid 2738 . . . . . . . 8 {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}
6 eqid 2738 . . . . . . . 8 {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}
7 eqid 2738 . . . . . . . 8 (𝐹‘∅) = (𝐹‘∅)
8 oef1o.g . . . . . . . . 9 (𝜑𝐺:𝐵1-1-onto𝐷)
9 f1ocnv 6712 . . . . . . . . 9 (𝐺:𝐵1-1-onto𝐷𝐺:𝐷1-1-onto𝐵)
108, 9syl 17 . . . . . . . 8 (𝜑𝐺:𝐷1-1-onto𝐵)
11 oef1o.f . . . . . . . 8 (𝜑𝐹:𝐴1-1-onto𝐶)
12 oef1o.b . . . . . . . 8 (𝜑𝐵 ∈ On)
13 oef1o.a . . . . . . . 8 (𝜑𝐴 ∈ (On ∖ 1o))
14 ondif1 8293 . . . . . . . . . 10 (𝐴 ∈ (On ∖ 1o) ↔ (𝐴 ∈ On ∧ ∅ ∈ 𝐴))
1514simprbi 496 . . . . . . . . 9 (𝐴 ∈ (On ∖ 1o) → ∅ ∈ 𝐴)
1613, 15syl 17 . . . . . . . 8 (𝜑 → ∅ ∈ 𝐴)
175, 6, 7, 10, 11, 12, 13, 3, 2, 16mapfien 9097 . . . . . . 7 (𝜑 → (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺))):{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
18 oef1o.k . . . . . . . 8 𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺)))
19 f1oeq1 6688 . . . . . . . 8 (𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺))) → (𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺))):{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
2018, 19ax-mp 5 . . . . . . 7 (𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦𝐺))):{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
2117, 20sylibr 233 . . . . . 6 (𝜑𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
22 eqid 2738 . . . . . . . . 9 {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp ∅}
2322, 2, 3cantnfdm 9352 . . . . . . . 8 (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp ∅})
24 oef1o.z . . . . . . . . . 10 (𝜑 → (𝐹‘∅) = ∅)
2524breq2d 5082 . . . . . . . . 9 (𝜑 → (𝑥 finSupp (𝐹‘∅) ↔ 𝑥 finSupp ∅))
2625rabbidv 3404 . . . . . . . 8 (𝜑 → {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp ∅})
2723, 26eqtr4d 2781 . . . . . . 7 (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
2827f1oeq3d 6697 . . . . . 6 (𝜑 → (𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
2921, 28mpbird 256 . . . . 5 (𝜑𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷))
3013eldifad 3895 . . . . . . 7 (𝜑𝐴 ∈ On)
315, 30, 12cantnfdm 9352 . . . . . 6 (𝜑 → dom (𝐴 CNF 𝐵) = {𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅})
3231f1oeq2d 6696 . . . . 5 (𝜑 → (𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷)))
3329, 32mpbird 256 . . . 4 (𝜑𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷))
34 f1oco 6722 . . . 4 (((𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶o 𝐷) ∧ 𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷)) → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶o 𝐷))
354, 33, 34syl2anc 583 . . 3 (𝜑 → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶o 𝐷))
36 eqid 2738 . . . . 5 dom (𝐴 CNF 𝐵) = dom (𝐴 CNF 𝐵)
3736, 30, 12cantnff1o 9384 . . . 4 (𝜑 → (𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴o 𝐵))
38 f1ocnv 6712 . . . 4 ((𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴o 𝐵) → (𝐴 CNF 𝐵):(𝐴o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
3937, 38syl 17 . . 3 (𝜑(𝐴 CNF 𝐵):(𝐴o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
40 f1oco 6722 . . 3 ((((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶o 𝐷) ∧ (𝐴 CNF 𝐵):(𝐴o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵)) → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵)):(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷))
4135, 39, 40syl2anc 583 . 2 (𝜑 → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵)):(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷))
42 oef1o.h . . 3 𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵))
43 f1oeq1 6688 . . 3 (𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵)) → (𝐻:(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵)):(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷)))
4442, 43ax-mp 5 . 2 (𝐻:(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ (𝐴 CNF 𝐵)):(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷))
4541, 44sylibr 233 1 (𝜑𝐻:(𝐴o 𝐵)–1-1-onto→(𝐶o 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1539  wcel 2108  {crab 3067  cdif 3880  c0 4253   class class class wbr 5070  cmpt 5153  ccnv 5579  dom cdm 5580  ccom 5584  Oncon0 6251  1-1-ontowf1o 6417  cfv 6418  (class class class)co 7255  1oc1o 8260  o coe 8266  m cmap 8573   finSupp cfsupp 9058   CNF ccnf 9349
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-supp 7949  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-seqom 8249  df-1o 8267  df-2o 8268  df-oadd 8271  df-omul 8272  df-oexp 8273  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-fsupp 9059  df-oi 9199  df-cnf 9350
This theorem is referenced by:  infxpenc  9705
  Copyright terms: Public domain W3C validator