Theorem oef1o 9699

Description: A bijection of the base sets induces a bijection on ordinal exponentials. (The assumption (𝐹‘∅) = ∅ can be discharged using fveqf1o 7304.) (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 2731	. . . . 5 ⊢ dom (𝐶 CNF 𝐷) = dom (𝐶 CNF 𝐷)
2		oef1o.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ On)
3		oef1o.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ On)
4	1, 2, 3	cantnff1o 9697	. . . 4 ⊢ (𝜑 → (𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶 ↑o 𝐷))
5		eqid 2731	. . . . . . . 8 ⊢ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}
6		eqid 2731	. . . . . . . 8 ⊢ {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}
7		eqid 2731	. . . . . . . 8 ⊢ (𝐹‘∅) = (𝐹‘∅)
8		oef1o.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
9		f1ocnv 6845	. . . . . . . . 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	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ On)
13		oef1o.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ (On ∖ 1o))
14		ondif1 8507	. . . . . . . . . 10 ⊢ (𝐴 ∈ (On ∖ 1o) ↔ (𝐴 ∈ On ∧ ∅ ∈ 𝐴))
15	14	simprbi 496	. . . . . . . . 9 ⊢ (𝐴 ∈ (On ∖ 1o) → ∅ ∈ 𝐴)
16	13, 15	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ 𝐴)
17	5, 6, 7, 10, 11, 12, 13, 3, 2, 16	mapfien 9409	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
18		oef1o.k	. . . . . . . 8 ⊢ 𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺)))
19		f1oeq1 6821	. . . . . . . 8 ⊢ (𝐾 = (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))) → (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
20	18, 19	ax-mp 5	. . . . . . 7 ⊢ (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} ↔ (𝑦 ∈ {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅} ↦ (𝐹 ∘ (𝑦 ∘ ◡𝐺))):{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
21	17, 20	sylibr 233	. . . . . 6 ⊢ (𝜑 → 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
22		eqid 2731	. . . . . . . . 9 ⊢ {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅}
23	22, 2, 3	cantnfdm 9665	. . . . . . . 8 ⊢ (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅})
24		oef1o.z	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹‘∅) = ∅)
25	24	breq2d 5160	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 finSupp (𝐹‘∅) ↔ 𝑥 finSupp ∅))
26	25	rabbidv 3439	. . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)} = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp ∅})
27	23, 26	eqtr4d 2774	. . . . . . 7 ⊢ (𝜑 → dom (𝐶 CNF 𝐷) = {𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)})
28	27	f1oeq3d 6830	. . . . . 6 ⊢ (𝜑 → (𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→{𝑥 ∈ (𝐶 ↑m 𝐷) ∣ 𝑥 finSupp (𝐹‘∅)}))
29	21, 28	mpbird 257	. . . . 5 ⊢ (𝜑 → 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷))
30	13	eldifad 3960	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ On)
31	5, 30, 12	cantnfdm 9665	. . . . . 6 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅})
32	31	f1oeq2d 6829	. . . . 5 ⊢ (𝜑 → (𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷) ↔ 𝐾:{𝑥 ∈ (𝐴 ↑m 𝐵) ∣ 𝑥 finSupp ∅}–1-1-onto→dom (𝐶 CNF 𝐷)))
33	29, 32	mpbird 257	. . . 4 ⊢ (𝜑 → 𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷))
34		f1oco 6856	. . . 4 ⊢ (((𝐶 CNF 𝐷):dom (𝐶 CNF 𝐷)–1-1-onto→(𝐶 ↑o 𝐷) ∧ 𝐾:dom (𝐴 CNF 𝐵)–1-1-onto→dom (𝐶 CNF 𝐷)) → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
35	4, 33, 34	syl2anc 583	. . 3 ⊢ (𝜑 → ((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
36		eqid 2731	. . . . 5 ⊢ dom (𝐴 CNF 𝐵) = dom (𝐴 CNF 𝐵)
37	36, 30, 12	cantnff1o 9697	. . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴 ↑o 𝐵))
38		f1ocnv 6845	. . . 4 ⊢ ((𝐴 CNF 𝐵):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐴 ↑o 𝐵) → ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
39	37, 38	syl 17	. . 3 ⊢ (𝜑 → ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵))
40		f1oco 6856	. . 3 ⊢ ((((𝐶 CNF 𝐷) ∘ 𝐾):dom (𝐴 CNF 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ∧ ◡(𝐴 CNF 𝐵):(𝐴 ↑o 𝐵)–1-1-onto→dom (𝐴 CNF 𝐵)) → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
41	35, 39, 40	syl2anc 583	. 2 ⊢ (𝜑 → (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
42		oef1o.h	. . 3 ⊢ 𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵))
43		f1oeq1 6821	. . 3 ⊢ (𝐻 = (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)) → (𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷)))
44	42, 43	ax-mp 5	. 2 ⊢ (𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷) ↔ (((𝐶 CNF 𝐷) ∘ 𝐾) ∘ ◡(𝐴 CNF 𝐵)):(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))
45	41, 44	sylibr 233	1 ⊢ (𝜑 → 𝐻:(𝐴 ↑o 𝐵)–1-1-onto→(𝐶 ↑o 𝐷))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1540   ∈ wcel 2105  {crab 3431   ∖ cdif 3945  ∅c0 4322   class class class wbr 5148   ↦ cmpt 5231  ^◡ccnv 5675  dom cdm 5676   ∘ ccom 5680  Oncon0 6364  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7412  1_oc1o 8465   ↑_o coe 8471   ↑_m cmap 8826   finSupp cfsupp 9367   CNF ccnf 9662

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-se 5632  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7368  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7860  df-1st 7979  df-2nd 7980  df-supp 8152  df-frecs 8272  df-wrecs 8303  df-recs 8377  df-rdg 8416  df-seqom 8454  df-1o 8472  df-2o 8473  df-oadd 8476  df-omul 8477  df-oexp 8478  df-er 8709  df-map 8828  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-fsupp 9368  df-oi 9511  df-cnf 9663

This theorem is referenced by:  infxpenc  10019