Theorem oef1o 9145

Description: A bijection of the base sets induces a bijection on ordinal exponentials. (The assumption (𝐹‘∅) = ∅ can be discharged using fveqf1o 7037.) (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

Step	Hyp	Ref	Expression
1		eqid 2798	. . . . 5 ⊢ dom (𝐶 CNF 𝐷) = dom (𝐶 CNF 𝐷)
2		oef1o.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ On)
3		oef1o.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ On)
4	1, 2, 3	cantnff1o 9143	. . . 4 ⊢ (𝜑 → (𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶 ↑o 𝐷))
5		eqid 2798	. . . . . . . 8 ⊢ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}
6		eqid 2798	. . . . . . . 8 ⊢ {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}
7		eqid 2798	. . . . . . . 8 ⊢ (𝐹‘∅) = (𝐹‘∅)
8		oef1o.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
9		f1ocnv 6602	. . . . . . . . 9 ⊢ (𝐺:𝐵–1-1-onto→𝐷 → ◡𝐺:𝐷–1-1-onto→𝐵)
10	8, 9	syl 17	. . . . . . . 8 ⊢ (𝜑 → ◡𝐺:𝐷–1-1-onto→𝐵)
11		oef1o.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐶)
12		oef1o.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ On)
13	12	elexd 3461	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ V)
14		oef1o.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ (On ∖ 1o))
15	14	elexd 3461	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ V)
16	3	elexd 3461	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ V)
17	2	elexd 3461	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ V)
18		ondif1 8109	. . . . . . . . . 10 ⊢ (𝐴 ∈ (On ∖ 1o) ↔ (𝐴 ∈ On ∧ ∅ ∈ 𝐴))
19	18	simprbi 500	. . . . . . . . 9 ⊢ (𝐴 ∈ (On ∖ 1o) → ∅ ∈ 𝐴)
20	14, 19	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ 𝐴)
21	5, 6, 7, 10, 11, 13, 15, 16, 17, 20	mapfien 8855	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
22		oef1o.k	. . . . . . . 8 ⊢ 𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺)))
23		f1oeq1 6579	. . . . . . . 8 ⊢ (𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))) → (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
24	22, 23	ax-mp 5	. . . . . . 7 ⊢ (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
25	21, 24	sylibr 237	. . . . . 6 ⊢ (𝜑 → 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
26		eqid 2798	. . . . . . . . 9 ⊢ {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅}
27	26, 2, 3	cantnfdm 9111	. . . . . . . 8 ⊢ (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅})
28		oef1o.z	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹‘∅) = ∅)
29	28	breq2d 5042	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 finSupp (𝐹‘∅) ↔ 𝑥 finSupp ∅))
30	29	rabbidv 3427	. . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅})
31	27, 30	eqtr4d 2836	. . . . . . 7 ⊢ (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
32	31	f1oeq3d 6587	. . . . . 6 ⊢ (𝜑 → (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
33	25, 32	mpbird 260	. . . . 5 ⊢ (𝜑 → 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷))
34	14	eldifad 3893	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ On)
35	5, 34, 12	cantnfdm 9111	. . . . . 6 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅})
36	35	f1oeq2d 6586	. . . . 5 ⊢ (𝜑 → (𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷)))
37	33, 36	mpbird 260	. . . 4 ⊢ (𝜑 → 𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷))
38		f1oco 6612	. . . 4 ⊢ (((𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶 ↑o 𝐷) ∧ 𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷)) → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
39	4, 37, 38	syl2anc 587	. . 3 ⊢ (𝜑 → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
40		eqid 2798	. . . . 5 ⊢ dom (𝐴 CNF 𝐵) = dom (𝐴 CNF 𝐵)
41	40, 34, 12	cantnff1o 9143	. . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴 ↑o 𝐵))
42		f1ocnv 6602	. . . 4 ⊢ ((𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴 ↑o 𝐵) → ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
43	41, 42	syl 17	. . 3 ⊢ (𝜑 → ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
44		f1oco 6612	. . 3 ⊢ ((((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ∧ ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵)) → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
45	39, 43, 44	syl2anc 587	. 2 ⊢ (𝜑 → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
46		oef1o.h	. . 3 ⊢ 𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵))
47		f1oeq1 6579	. . 3 ⊢ (𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)) → (𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷)))
48	46, 47	ax-mp 5	. 2 ⊢ (𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
49	45, 48	sylibr 237	1 ⊢ (𝜑 → 𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  {crab 3110   ∖ cdif 3878  ∅c0 4243   class class class wbr 5030   ↦ cmpt 5110  ^◡ccnv 5518  dom cdm 5519   ∘ ccom 5523  Oncon0 6159  –1-1-onto→wf1o 6323  ‘cfv 6324  (class class class)co 7135  1_oc1o 8078   ↑_o coe 8084   ↑_m cmap 8389   finSupp cfsupp 8817   CNF ccnf 9108

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-supp 7814  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-seqom 8067  df-1o 8085  df-2o 8086  df-oadd 8089  df-omul 8090  df-oexp 8091  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-fsupp 8818  df-oi 8958  df-cnf 9109

This theorem is referenced by:  infxpenc  9429