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

Theorem cantnflem4 9730
Description: Lemma for cantnf 9731. Complete the induction step of cantnflem3 9729. (Contributed by Mario Carneiro, 25-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 ‘𝑃)
Assertion
Ref Expression
cantnflem4 (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))
Distinct variable groups:   𝑤,𝑐,𝑥,𝑦,𝑧,𝐵   𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧,𝐶   𝐴,𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐   𝑆,𝑐,𝑥,𝑦,𝑧   𝑥,𝑍,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑤,𝑌,𝑥,𝑦,𝑧   𝑋,𝑎,𝑏,𝑑,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑤, 𝑎, 𝑏, 𝑐, 𝑑)   𝐵(𝑎, 𝑏, 𝑑)   𝑃(𝑥, 𝑦, 𝑧, 𝑤, 𝑎, 𝑏, 𝑐, 𝑑)   𝑆(𝑤, 𝑎, 𝑏, 𝑑)   𝑇(𝑥, 𝑦, 𝑧, 𝑤, 𝑎, 𝑏, 𝑑)   𝑋(𝑐)   𝑌(𝑎, 𝑏, 𝑐, 𝑑)   𝑍(𝑤, 𝑎, 𝑏, 𝑐, 𝑑)

Proof of Theorem cantnflem4
Dummy variables 𝑔 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cantnf.s . . . 4 (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
2 cantnfs.a . . . . . . . . 9 (𝜑 → 𝐴 ∈ On)
3 cantnfs.s . . . . . . . . . . . . 13 𝑆 = dom (𝐴 CNF 𝐵)
4 cantnfs.b . . . . . . . . . . . . 13 (𝜑 → 𝐵 ∈ On)
5 oemapval.t . . . . . . . . . . . . 13 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
6 cantnf.c . . . . . . . . . . . . 13 (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
7 cantnf.e . . . . . . . . . . . . 13 (𝜑 → ∅ ∈ 𝐶)
83, 2, 4, 5, 6, 1, 7cantnflem2 9728 . . . . . . . . . . . 12 (𝜑 → (𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)))
9 eqid 2763 . . . . . . . . . . . . . 14 𝑋 = 𝑋
10 eqid 2763 . . . . . . . . . . . . . 14 𝑌 = 𝑌
11 eqid 2763 . . . . . . . . . . . . . 14 𝑍 = 𝑍
129, 10, 113pm3.2i 1358 . . . . . . . . . . . . 13 (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)
13 cantnf.x . . . . . . . . . . . . . 14 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
14 cantnf.p . . . . . . . . . . . . . 14 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
15 cantnf.y . . . . . . . . . . . . . 14 𝑌 = (1st ‘𝑃)
16 cantnf.z . . . . . . . . . . . . . 14 𝑍 = (2nd ‘𝑃)
1713, 14, 15, 16oeeui 8649 . . . . . . . . . . . . 13 ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → (((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶) ↔ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)))
1812, 17mpbiri 261 . . . . . . . . . . . 12 ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
198, 18syl 18 . . . . . . . . . . 11 (𝜑 → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
2019simpld 500 . . . . . . . . . 10 (𝜑 → (𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)))
2120simp1d 1160 . . . . . . . . 9 (𝜑 → 𝑋 ∈ On)
22 oecl 8583 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑o 𝑋) ∈ On)
232, 21, 22syl2anc 596 . . . . . . . 8 (𝜑 → (𝐴 ↑o 𝑋) ∈ On)
2420simp2d 1161 . . . . . . . . . 10 (𝜑 → 𝑌 ∈ (𝐴 ∖ 1o))
2524eldifad 4054 . . . . . . . . 9 (𝜑 → 𝑌 ∈ 𝐴)
26 onelon 6413 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ On)
272, 25, 26syl2anc 596 . . . . . . . 8 (𝜑 → 𝑌 ∈ On)
28 omcl 8582 . . . . . . . 8 (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
2923, 27, 28syl2anc 596 . . . . . . 7 (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
3020simp3d 1162 . . . . . . . 8 (𝜑 → 𝑍 ∈ (𝐴 ↑o 𝑋))
31 onelon 6413 . . . . . . . 8 (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → 𝑍 ∈ On)
3223, 30, 31syl2anc 596 . . . . . . 7 (𝜑 → 𝑍 ∈ On)
33 oaword1 8598 . . . . . . 7 ((((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On ∧ 𝑍 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
3429, 32, 33syl2anc 596 . . . . . 6 (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
35 dif1o 8546 . . . . . . . . . . 11 (𝑌 ∈ (𝐴 ∖ 1o) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ≠ ∅))
3635simprbi 503 . . . . . . . . . 10 (𝑌 ∈ (𝐴 ∖ 1o) → 𝑌 ≠ ∅)
3724, 36syl 18 . . . . . . . . 9 (𝜑 → 𝑌 ≠ ∅)
38 on0eln0 6446 . . . . . . . . . 10 (𝑌 ∈ On → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
3927, 38syl 18 . . . . . . . . 9 (𝜑 → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
4037, 39mpbird 260 . . . . . . . 8 (𝜑 → ∅ ∈ 𝑌)
41 omword1 8619 . . . . . . . 8 ((((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) ∧ ∅ ∈ 𝑌) → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
4223, 27, 40, 41syl21anc 851 . . . . . . 7 (𝜑 → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
4342, 30sseldd 3914 . . . . . 6 (𝜑 → 𝑍 ∈ ((𝐴 ↑o 𝑋) ·o 𝑌))
4434, 43sseldd 3914 . . . . 5 (𝜑 → 𝑍 ∈ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
4519simprd 501 . . . . 5 (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶)
4644, 45eleqtrd 2866 . . . 4 (𝜑 → 𝑍 ∈ 𝐶)
471, 46sseldd 3914 . . 3 (𝜑 → 𝑍 ∈ ran (𝐴 CNF 𝐵))
483, 2, 4cantnff 9712 . . . 4 (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵))
49 ffn 6739 . . . 4 ((𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵) → (𝐴 CNF 𝐵) Fn 𝑆)
50 fvelrnb 6976 . . . 4 ((𝐴 CNF 𝐵) Fn 𝑆 → (𝑍 ∈ ran (𝐴 CNF 𝐵) ↔ ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍))
5148, 49, 503syl 19 . . 3 (𝜑 → (𝑍 ∈ ran (𝐴 CNF 𝐵) ↔ ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍))
5247, 51mpbid 235 . 2 (𝜑 → ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)
532adantr 486 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐴 ∈ On)
544adantr 486 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐵 ∈ On)
556adantr 486 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ∈ (𝐴 ↑o 𝐵))
561adantr 486 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
577adantr 486 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → ∅ ∈ 𝐶)
58 simprl 783 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝑔 ∈ 𝑆)
59 simprr 785 . . 3 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)
60 eqid 2763 . . 3 (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝑔‘𝑡))) = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝑔‘𝑡)))
613, 53, 54, 5, 55, 56, 57, 13, 14, 15, 16, 58, 59, 60cantnflem3 9729 . 2 ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ∈ ran (𝐴 CNF 𝐵))
6252, 61rexlimddv 3173 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   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ifcif 4485  ⟨cop 4840  ∪ cuni 4872  ∩ cint 4912  {copab 5173   ↦ cmpt 5192  dom cdm 5658  ran crn 5659  Oncon0 6388  ℩cio 6518   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  1oc1o 8507  2oc2o 8508   +o coa 8511   ·o comu 8512   ↑o coe 8513   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:  cantnf  9731
  Copyright terms: Public domain W3C validator