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

Theorem cantnflem3 9729
Description: Lemma for cantnf 9731. Here we show existence of Cantor normal forms. Assuming (by transfinite induction) that every number less than 𝐶 has a normal form, we can use oeeu 8650 to factor 𝐶 into the form ((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍 where 0 < 𝑌 < 𝐴 and 𝑍 < (𝐴 ↑o 𝑋) (and a fortiori 𝑋 < 𝐵). Then since 𝑍 < (𝐴 ↑o 𝑋) ≤ (𝐴 ↑o 𝑋) ·o 𝑌 ≤ 𝐶, 𝑍 has a normal form, and by appending the term (𝐴 ↑o 𝑋) ·o 𝑌 using cantnfp1 9719 we get a normal form for 𝐶. (Contributed by Mario Carneiro, 28-May-2015.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑 → 𝐴 ∈ On)
cantnfs.b (𝜑 → 𝐵 ∈ On)
oemapval.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
cantnf.c (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
cantnf.s (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
cantnf.e (𝜑 → ∅ ∈ 𝐶)
cantnf.x 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
cantnf.p 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
cantnf.y 𝑌 = (1st ‘𝑃)
cantnf.z 𝑍 = (2nd ‘𝑃)
cantnf.g (𝜑 → 𝐺 ∈ 𝑆)
cantnf.v (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
cantnf.f 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))
Assertion
Ref Expression
cantnflem3 (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))
Distinct variable groups:   𝑡,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧,𝐶   𝑡,𝑎,𝐴,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑡   𝑤,𝐹,𝑥,𝑦,𝑧   𝑆,𝑐,𝑡,𝑥,𝑦,𝑧   𝑡,𝑍,𝑥,𝑦,𝑧   𝐺,𝑐,𝑡,𝑤,𝑥,𝑦,𝑧   𝜑,𝑡,𝑥,𝑦,𝑧   𝑡,𝑌,𝑤,𝑥,𝑦,𝑧   𝑋,𝑎,𝑏,𝑑,𝑡,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑤, 𝑎, 𝑏, 𝑐, 𝑑)   𝐵(𝑎, 𝑏, 𝑑)   𝐶(𝑡)   𝑃(𝑥, 𝑦, 𝑧, 𝑤, 𝑡, 𝑎, 𝑏, 𝑐, 𝑑)   𝑆(𝑤, 𝑎, 𝑏, 𝑑)   𝑇(𝑥, 𝑦, 𝑧, 𝑤, 𝑎, 𝑏, 𝑑)   𝐹(𝑡, 𝑎, 𝑏, 𝑐, 𝑑)   𝐺(𝑎, 𝑏, 𝑑)   𝑋(𝑐)   𝑌(𝑎, 𝑏, 𝑐, 𝑑)   𝑍(𝑤, 𝑎, 𝑏, 𝑐, 𝑑)

Proof of Theorem cantnflem3
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 cantnfs.s . . . . 5 𝑆 = dom (𝐴 CNF 𝐵)
2 cantnfs.a . . . . 5 (𝜑 → 𝐴 ∈ On)
3 cantnfs.b . . . . 5 (𝜑 → 𝐵 ∈ On)
4 cantnf.g . . . . 5 (𝜑 → 𝐺 ∈ 𝑆)
5 oemapval.t . . . . . . . . . . . . . 14 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
6 cantnf.c . . . . . . . . . . . . . 14 (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
7 cantnf.s . . . . . . . . . . . . . 14 (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
8 cantnf.e . . . . . . . . . . . . . 14 (𝜑 → ∅ ∈ 𝐶)
91, 2, 3, 5, 6, 7, 8cantnflem2 9728 . . . . . . . . . . . . 13 (𝜑 → (𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)))
10 eqid 2763 . . . . . . . . . . . . . . 15 𝑋 = 𝑋
11 eqid 2763 . . . . . . . . . . . . . . 15 𝑌 = 𝑌
12 eqid 2763 . . . . . . . . . . . . . . 15 𝑍 = 𝑍
1310, 11, 123pm3.2i 1358 . . . . . . . . . . . . . 14 (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)
14 cantnf.x . . . . . . . . . . . . . . 15 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
15 cantnf.p . . . . . . . . . . . . . . 15 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
16 cantnf.y . . . . . . . . . . . . . . 15 𝑌 = (1st ‘𝑃)
17 cantnf.z . . . . . . . . . . . . . . 15 𝑍 = (2nd ‘𝑃)
1814, 15, 16, 17oeeui 8649 . . . . . . . . . . . . . 14 ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → (((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶) ↔ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)))
1913, 18mpbiri 261 . . . . . . . . . . . . 13 ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
209, 19syl 18 . . . . . . . . . . . 12 (𝜑 → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
2120simpld 500 . . . . . . . . . . 11 (𝜑 → (𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)))
2221simp1d 1160 . . . . . . . . . 10 (𝜑 → 𝑋 ∈ On)
23 oecl 8583 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑o 𝑋) ∈ On)
242, 22, 23syl2anc 596 . . . . . . . . 9 (𝜑 → (𝐴 ↑o 𝑋) ∈ On)
2521simp2d 1161 . . . . . . . . . . 11 (𝜑 → 𝑌 ∈ (𝐴 ∖ 1o))
2625eldifad 4054 . . . . . . . . . 10 (𝜑 → 𝑌 ∈ 𝐴)
27 onelon 6413 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ On)
282, 26, 27syl2anc 596 . . . . . . . . 9 (𝜑 → 𝑌 ∈ On)
29 dif1o 8546 . . . . . . . . . . . 12 (𝑌 ∈ (𝐴 ∖ 1o) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ≠ ∅))
3029simprbi 503 . . . . . . . . . . 11 (𝑌 ∈ (𝐴 ∖ 1o) → 𝑌 ≠ ∅)
3125, 30syl 18 . . . . . . . . . 10 (𝜑 → 𝑌 ≠ ∅)
32 on0eln0 6446 . . . . . . . . . . 11 (𝑌 ∈ On → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
3328, 32syl 18 . . . . . . . . . 10 (𝜑 → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
3431, 33mpbird 260 . . . . . . . . 9 (𝜑 → ∅ ∈ 𝑌)
35 omword1 8619 . . . . . . . . 9 ((((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) ∧ ∅ ∈ 𝑌) → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
3624, 28, 34, 35syl21anc 851 . . . . . . . 8 (𝜑 → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
37 omcl 8582 . . . . . . . . . . 11 (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
3824, 28, 37syl2anc 596 . . . . . . . . . 10 (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
3921simp3d 1162 . . . . . . . . . . 11 (𝜑 → 𝑍 ∈ (𝐴 ↑o 𝑋))
40 onelon 6413 . . . . . . . . . . 11 (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → 𝑍 ∈ On)
4124, 39, 40syl2anc 596 . . . . . . . . . 10 (𝜑 → 𝑍 ∈ On)
42 oaword1 8598 . . . . . . . . . 10 ((((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On ∧ 𝑍 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
4338, 41, 42syl2anc 596 . . . . . . . . 9 (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
4420simprd 501 . . . . . . . . 9 (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶)
4543, 44sseqtrd 3949 . . . . . . . 8 (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ 𝐶)
4636, 45sstrd 3923 . . . . . . 7 (𝜑 → (𝐴 ↑o 𝑋) ⊆ 𝐶)
47 oecl 8583 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) ∈ On)
482, 3, 47syl2anc 596 . . . . . . . 8 (𝜑 → (𝐴 ↑o 𝐵) ∈ On)
49 ontr2 6437 . . . . . . . 8 (((𝐴 ↑o 𝑋) ∈ On ∧ (𝐴 ↑o 𝐵) ∈ On) → (((𝐴 ↑o 𝑋) ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 ↑o 𝐵)) → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
5024, 48, 49syl2anc 596 . . . . . . 7 (𝜑 → (((𝐴 ↑o 𝑋) ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 ↑o 𝐵)) → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
5146, 6, 50mp2and 712 . . . . . 6 (𝜑 → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵))
529simpld 500 . . . . . . 7 (𝜑 → 𝐴 ∈ (On ∖ 2o))
53 oeord 8635 . . . . . . 7 ((𝑋 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ (On ∖ 2o)) → (𝑋 ∈ 𝐵 ↔ (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
5422, 3, 52, 53syl3anc 1399 . . . . . 6 (𝜑 → (𝑋 ∈ 𝐵 ↔ (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
5551, 54mpbird 260 . . . . 5 (𝜑 → 𝑋 ∈ 𝐵)
562adantr 486 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐴 ∈ On)
573adantr 486 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐵 ∈ On)
58 suppssdm 8232 . . . . . . . . . . . . . . 15 (𝐺 supp ∅) ⊆ dom 𝐺
591, 2, 3cantnfs 9704 . . . . . . . . . . . . . . . . 17 (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
604, 59mpbid 235 . . . . . . . . . . . . . . . 16 (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
6160simpld 500 . . . . . . . . . . . . . . 15 (𝜑 → 𝐺:𝐵⟶𝐴)
6258, 61fssdm 6759 . . . . . . . . . . . . . 14 (𝜑 → (𝐺 supp ∅) ⊆ 𝐵)
6362sselda 3913 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ 𝐵)
64 onelon 6413 . . . . . . . . . . . . 13 ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
6557, 63, 64syl2anc 596 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ On)
66 oecl 8583 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ↑o 𝑥) ∈ On)
6756, 65, 66syl2anc 596 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ∈ On)
6861adantr 486 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐺:𝐵⟶𝐴)
6968, 63ffvelcdmd 7117 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ∈ 𝐴)
70 onelon 6413 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ (𝐺‘𝑥) ∈ 𝐴) → (𝐺‘𝑥) ∈ On)
7156, 69, 70syl2anc 596 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ∈ On)
7261ffnd 6740 . . . . . . . . . . . . . 14 (𝜑 → 𝐺 Fn 𝐵)
738elexd 3477 . . . . . . . . . . . . . 14 (𝜑 → ∅ ∈ V)
74 elsuppfn 8225 . . . . . . . . . . . . . 14 ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ On ∧ ∅ ∈ V) → (𝑥 ∈ (𝐺 supp ∅) ↔ (𝑥 ∈ 𝐵 ∧ (𝐺‘𝑥) ≠ ∅)))
7572, 3, 73, 74syl3anc 1399 . . . . . . . . . . . . 13 (𝜑 → (𝑥 ∈ (𝐺 supp ∅) ↔ (𝑥 ∈ 𝐵 ∧ (𝐺‘𝑥) ≠ ∅)))
7675simplbda 505 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ≠ ∅)
77 on0eln0 6446 . . . . . . . . . . . . 13 ((𝐺‘𝑥) ∈ On → (∅ ∈ (𝐺‘𝑥) ↔ (𝐺‘𝑥) ≠ ∅))
7871, 77syl 18 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (∅ ∈ (𝐺‘𝑥) ↔ (𝐺‘𝑥) ≠ ∅))
7976, 78mpbird 260 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ∅ ∈ (𝐺‘𝑥))
80 omword1 8619 . . . . . . . . . . 11 ((((𝐴 ↑o 𝑥) ∈ On ∧ (𝐺‘𝑥) ∈ On) ∧ ∅ ∈ (𝐺‘𝑥)) → (𝐴 ↑o 𝑥) ⊆ ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)))
8167, 71, 79, 80syl21anc 851 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ⊆ ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)))
82 eqid 2763 . . . . . . . . . . . 12 OrdIso( E , (𝐺 supp ∅)) = OrdIso( E , (𝐺 supp ∅))
834adantr 486 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐺 ∈ 𝑆)
84 eqid 2763 . . . . . . . . . . . 12 seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +o 𝑧)), ∅)
851, 56, 57, 82, 83, 84, 63cantnfle 9709 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)) ⊆ ((𝐴 CNF 𝐵)‘𝐺))
86 cantnf.v . . . . . . . . . . . 12 (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
8786adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
8885, 87sseqtrd 3949 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)) ⊆ 𝑍)
8981, 88sstrd 3923 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ⊆ 𝑍)
9039adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑍 ∈ (𝐴 ↑o 𝑋))
9124adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑋) ∈ On)
92 ontr2 6437 . . . . . . . . . 10 (((𝐴 ↑o 𝑥) ∈ On ∧ (𝐴 ↑o 𝑋) ∈ On) → (((𝐴 ↑o 𝑥) ⊆ 𝑍 ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
9367, 91, 92syl2anc 596 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (((𝐴 ↑o 𝑥) ⊆ 𝑍 ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
9489, 90, 93mp2and 712 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋))
9522adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑋 ∈ On)
9652adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐴 ∈ (On ∖ 2o))
97 oeord 8635 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑋 ∈ On ∧ 𝐴 ∈ (On ∖ 2o)) → (𝑥 ∈ 𝑋 ↔ (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
9865, 95, 96, 97syl3anc 1399 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝑥 ∈ 𝑋 ↔ (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
9994, 98mpbird 260 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ 𝑋)
10099ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ (𝐺 supp ∅) → 𝑥 ∈ 𝑋))
101100ssrdv 3919 . . . . 5 (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
102 cantnf.f . . . . 5 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))
1031, 2, 3, 4, 55, 26, 101, 102cantnfp1 9719 . . . 4 (𝜑 → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺))))
104103simprd 501 . . 3 (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺)))
10586oveq2d 7467 . . 3 (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺)) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
106104, 105, 443eqtrd 2802 . 2 (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = 𝐶)
1071, 2, 3cantnff 9712 . . . 4 (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵))
108107ffnd 6740 . . 3 (𝜑 → (𝐴 CNF 𝐵) Fn 𝑆)
109103simpld 500 . . 3 (𝜑 → 𝐹 ∈ 𝑆)
110 fnfvelrn 7112 . . 3 (((𝐴 CNF 𝐵) Fn 𝑆 ∧ 𝐹 ∈ 𝑆) → ((𝐴 CNF 𝐵)‘𝐹) ∈ ran (𝐴 CNF 𝐵))
111108, 109, 110syl2anc 596 . 2 (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) ∈ ran (𝐴 CNF 𝐵))
112106, 111eqeltrrd 2865 1 (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ifcif 4485  ⟨cop 4840  ∪ cuni 4872  ∩ cint 4912   class class class wbr 5108  {copab 5173   ↦ cmpt 5192   E cep 5557  dom cdm 5658  ran crn 5659  Oncon0 6388  ℩cio 6518   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034   supp csupp 8214  seqωcseqom 8495  1oc1o 8507  2oc2o 8508   +o coa 8511   ·o comu 8512   ↑o coe 8513   finSupp cfsupp 9391  OrdIsocoi 9540   CNF ccnf 9699
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-supp 8215  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496  df-1o 8514  df-2o 8515  df-oadd 8518  df-omul 8519  df-oexp 8520  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-fsupp 9392  df-oi 9541  df-cnf 9700
This theorem is used by:  cantnflem4  9730
  Copyright terms: Public domain W3C validator