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

Theorem cantnflem1c 9756
Description: Lemma for cantnf 9762. (Contributed by Mario Carneiro, 4-Jun-2015.) (Revised by AV, 2-Jul-2019.) (Proof shortened by AV, 4-Apr-2020.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑𝐴 ∈ On)
cantnfs.b (𝜑𝐵 ∈ On)
oemapval.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
oemapval.f (𝜑𝐹𝑆)
oemapval.g (𝜑𝐺𝑆)
oemapvali.r (𝜑𝐹𝑇𝐺)
oemapvali.x 𝑋 = {𝑐𝐵 ∣ (𝐹𝑐) ∈ (𝐺𝑐)}
cantnflem1.o 𝑂 = OrdIso( E , (𝐺 supp ∅))
Assertion
Ref Expression
cantnflem1c ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ (𝐺 supp ∅))
Distinct variable groups:   𝑢,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝐴,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑢   𝑢,𝐹,𝑤,𝑥,𝑦,𝑧   𝑆,𝑐,𝑢,𝑥,𝑦,𝑧   𝐺,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑢,𝑂,𝑤,𝑥,𝑦,𝑧   𝜑,𝑢,𝑥,𝑦,𝑧   𝑢,𝑋,𝑤,𝑥,𝑦,𝑧   𝐹,𝑐   𝜑,𝑐
Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)   𝑂(𝑐)   𝑋(𝑐)

Proof of Theorem cantnflem1c
StepHypRef Expression
1 cantnfs.b . . 3 (𝜑𝐵 ∈ On)
21ad3antrrr 729 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝐵 ∈ On)
3 simplr 768 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥𝐵)
4 oemapval.g . . . . . 6 (𝜑𝐺𝑆)
5 cantnfs.s . . . . . . 7 𝑆 = dom (𝐴 CNF 𝐵)
6 cantnfs.a . . . . . . 7 (𝜑𝐴 ∈ On)
75, 6, 1cantnfs 9735 . . . . . 6 (𝜑 → (𝐺𝑆 ↔ (𝐺:𝐵𝐴𝐺 finSupp ∅)))
84, 7mpbid 232 . . . . 5 (𝜑 → (𝐺:𝐵𝐴𝐺 finSupp ∅))
98simpld 494 . . . 4 (𝜑𝐺:𝐵𝐴)
109ffnd 6748 . . 3 (𝜑𝐺 Fn 𝐵)
1110ad3antrrr 729 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝐺 Fn 𝐵)
12 oemapval.t . . . . . . 7 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
13 oemapval.f . . . . . . 7 (𝜑𝐹𝑆)
14 oemapvali.r . . . . . . 7 (𝜑𝐹𝑇𝐺)
15 oemapvali.x . . . . . . 7 𝑋 = {𝑐𝐵 ∣ (𝐹𝑐) ∈ (𝐺𝑐)}
16 cantnflem1.o . . . . . . 7 𝑂 = OrdIso( E , (𝐺 supp ∅))
175, 6, 1, 12, 13, 4, 14, 15, 16cantnflem1b 9755 . . . . . 6 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) → 𝑋 ⊆ (𝑂𝑢))
1817ad2antrr 725 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋 ⊆ (𝑂𝑢))
19 simprr 772 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝑂𝑢) ∈ 𝑥)
205, 6, 1, 12, 13, 4, 14, 15oemapvali 9753 . . . . . . . . 9 (𝜑 → (𝑋𝐵 ∧ (𝐹𝑋) ∈ (𝐺𝑋) ∧ ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤))))
2120simp1d 1142 . . . . . . . 8 (𝜑𝑋𝐵)
22 onelon 6420 . . . . . . . 8 ((𝐵 ∈ On ∧ 𝑋𝐵) → 𝑋 ∈ On)
231, 21, 22syl2anc 583 . . . . . . 7 (𝜑𝑋 ∈ On)
2423ad3antrrr 729 . . . . . 6 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋 ∈ On)
25 onss 7820 . . . . . . . . 9 (𝐵 ∈ On → 𝐵 ⊆ On)
261, 25syl 17 . . . . . . . 8 (𝜑𝐵 ⊆ On)
2726sselda 4008 . . . . . . 7 ((𝜑𝑥𝐵) → 𝑥 ∈ On)
2827ad4ant13 750 . . . . . 6 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ On)
29 ontr2 6442 . . . . . 6 ((𝑋 ∈ On ∧ 𝑥 ∈ On) → ((𝑋 ⊆ (𝑂𝑢) ∧ (𝑂𝑢) ∈ 𝑥) → 𝑋𝑥))
3024, 28, 29syl2anc 583 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → ((𝑋 ⊆ (𝑂𝑢) ∧ (𝑂𝑢) ∈ 𝑥) → 𝑋𝑥))
3118, 19, 30mp2and 698 . . . 4 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋𝑥)
32 eleq2w 2828 . . . . . 6 (𝑤 = 𝑥 → (𝑋𝑤𝑋𝑥))
33 fveq2 6920 . . . . . . 7 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
34 fveq2 6920 . . . . . . 7 (𝑤 = 𝑥 → (𝐺𝑤) = (𝐺𝑥))
3533, 34eqeq12d 2756 . . . . . 6 (𝑤 = 𝑥 → ((𝐹𝑤) = (𝐺𝑤) ↔ (𝐹𝑥) = (𝐺𝑥)))
3632, 35imbi12d 344 . . . . 5 (𝑤 = 𝑥 → ((𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)) ↔ (𝑋𝑥 → (𝐹𝑥) = (𝐺𝑥))))
3720simp3d 1144 . . . . . 6 (𝜑 → ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)))
3837ad3antrrr 729 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)))
3936, 38, 3rspcdva 3636 . . . 4 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝑋𝑥 → (𝐹𝑥) = (𝐺𝑥)))
4031, 39mpd 15 . . 3 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐹𝑥) = (𝐺𝑥))
41 simprl 770 . . 3 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐹𝑥) ≠ ∅)
4240, 41eqnetrrd 3015 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐺𝑥) ≠ ∅)
43 fvn0elsupp 8221 . 2 (((𝐵 ∈ On ∧ 𝑥𝐵) ∧ (𝐺 Fn 𝐵 ∧ (𝐺𝑥) ≠ ∅)) → 𝑥 ∈ (𝐺 supp ∅))
442, 3, 11, 42, 43syl22anc 838 1 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ (𝐺 supp ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  wne 2946  wral 3067  wrex 3076  {crab 3443  wss 3976  c0 4352   cuni 4931   class class class wbr 5166  {copab 5228   E cep 5598  ccnv 5699  dom cdm 5700  Oncon0 6395  suc csuc 6397   Fn wfn 6568  wf 6569  cfv 6573  (class class class)co 7448   supp csupp 8201   finSupp cfsupp 9431  OrdIsocoi 9578   CNF ccnf 9730
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-isom 6582  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-supp 8202  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-seqom 8504  df-1o 8522  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-fsupp 9432  df-oi 9579  df-cnf 9731
This theorem is referenced by:  cantnflem1  9758
  Copyright terms: Public domain W3C validator