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

Theorem ptcmplem2 23404
Description: Lemma for ptcmp 23409. (Contributed by Mario Carneiro, 26-Aug-2015.)
Hypotheses
Ref Expression
ptcmp.1 𝑆 = (𝑘𝐴, 𝑢 ∈ (𝐹𝑘) ↦ ((𝑤𝑋 ↦ (𝑤𝑘)) “ 𝑢))
ptcmp.2 𝑋 = X𝑛𝐴 (𝐹𝑛)
ptcmp.3 (𝜑𝐴𝑉)
ptcmp.4 (𝜑𝐹:𝐴⟶Comp)
ptcmp.5 (𝜑𝑋 ∈ (UFL ∩ dom card))
ptcmplem2.5 (𝜑𝑈 ⊆ ran 𝑆)
ptcmplem2.6 (𝜑𝑋 = 𝑈)
ptcmplem2.7 (𝜑 → ¬ ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
Assertion
Ref Expression
ptcmplem2 (𝜑 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
Distinct variable groups:   𝑘,𝑛,𝑢,𝑤,𝑧,𝐴   𝑆,𝑘,𝑛,𝑢,𝑧   𝜑,𝑘,𝑛,𝑢   𝑈,𝑘,𝑢,𝑧   𝑘,𝑉,𝑛,𝑢,𝑤,𝑧   𝑘,𝐹,𝑛,𝑢,𝑤,𝑧   𝑘,𝑋,𝑛,𝑢,𝑤,𝑧
Allowed substitution hints:   𝜑(𝑧,𝑤)   𝑆(𝑤)   𝑈(𝑤,𝑛)

Proof of Theorem ptcmplem2
Dummy variables 𝑓 𝑔 𝑚 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ptcmplem2.7 . . . 4 (𝜑 → ¬ ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
2 0ss 4356 . . . . . . 7 ∅ ⊆ 𝑈
3 0fin 9115 . . . . . . 7 ∅ ∈ Fin
4 elfpw 9298 . . . . . . 7 (∅ ∈ (𝒫 𝑈 ∩ Fin) ↔ (∅ ⊆ 𝑈 ∧ ∅ ∈ Fin))
52, 3, 4mpbir2an 709 . . . . . 6 ∅ ∈ (𝒫 𝑈 ∩ Fin)
6 unieq 4876 . . . . . . . 8 (𝑧 = ∅ → 𝑧 = ∅)
7 uni0 4896 . . . . . . . 8 ∅ = ∅
86, 7eqtrdi 2792 . . . . . . 7 (𝑧 = ∅ → 𝑧 = ∅)
98rspceeqv 3595 . . . . . 6 ((∅ ∈ (𝒫 𝑈 ∩ Fin) ∧ 𝑋 = ∅) → ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
105, 9mpan 688 . . . . 5 (𝑋 = ∅ → ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
1110necon3bi 2970 . . . 4 (¬ ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧𝑋 ≠ ∅)
121, 11syl 17 . . 3 (𝜑𝑋 ≠ ∅)
13 n0 4306 . . 3 (𝑋 ≠ ∅ ↔ ∃𝑓 𝑓𝑋)
1412, 13sylib 217 . 2 (𝜑 → ∃𝑓 𝑓𝑋)
15 ptcmp.2 . . . . . . 7 𝑋 = X𝑛𝐴 (𝐹𝑛)
16 fveq2 6842 . . . . . . . . 9 (𝑛 = 𝑘 → (𝐹𝑛) = (𝐹𝑘))
1716unieqd 4879 . . . . . . . 8 (𝑛 = 𝑘 (𝐹𝑛) = (𝐹𝑘))
1817cbvixpv 8853 . . . . . . 7 X𝑛𝐴 (𝐹𝑛) = X𝑘𝐴 (𝐹𝑘)
1915, 18eqtri 2764 . . . . . 6 𝑋 = X𝑘𝐴 (𝐹𝑘)
20 ptcmp.5 . . . . . . . 8 (𝜑𝑋 ∈ (UFL ∩ dom card))
2120elin2d 4159 . . . . . . 7 (𝜑𝑋 ∈ dom card)
2221adantr 481 . . . . . 6 ((𝜑𝑓𝑋) → 𝑋 ∈ dom card)
2319, 22eqeltrrid 2843 . . . . 5 ((𝜑𝑓𝑋) → X𝑘𝐴 (𝐹𝑘) ∈ dom card)
24 ssrab2 4037 . . . . . 6 {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴
2512adantr 481 . . . . . . 7 ((𝜑𝑓𝑋) → 𝑋 ≠ ∅)
2619, 25eqnetrrid 3019 . . . . . 6 ((𝜑𝑓𝑋) → X𝑘𝐴 (𝐹𝑘) ≠ ∅)
27 eqid 2736 . . . . . . 7 (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})) = (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
2827resixpfo 8874 . . . . . 6 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴X𝑘𝐴 (𝐹𝑘) ≠ ∅) → (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
2924, 26, 28sylancr 587 . . . . 5 ((𝜑𝑓𝑋) → (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
30 fonum 9994 . . . . 5 ((X𝑘𝐴 (𝐹𝑘) ∈ dom card ∧ (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘)) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
3123, 29, 30syl2anc 584 . . . 4 ((𝜑𝑓𝑋) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
32 vex 3449 . . . . . . . . . . 11 𝑔 ∈ V
33 difexg 5284 . . . . . . . . . . 11 (𝑔 ∈ V → (𝑔𝑓) ∈ V)
3432, 33mp1i 13 . . . . . . . . . 10 ((𝜑𝑓𝑋) → (𝑔𝑓) ∈ V)
35 dmexg 7840 . . . . . . . . . 10 ((𝑔𝑓) ∈ V → dom (𝑔𝑓) ∈ V)
36 uniexg 7677 . . . . . . . . . 10 (dom (𝑔𝑓) ∈ V → dom (𝑔𝑓) ∈ V)
3734, 35, 363syl 18 . . . . . . . . 9 ((𝜑𝑓𝑋) → dom (𝑔𝑓) ∈ V)
3837ralrimivw 3147 . . . . . . . 8 ((𝜑𝑓𝑋) → ∀𝑔𝑋 dom (𝑔𝑓) ∈ V)
39 eqid 2736 . . . . . . . . 9 (𝑔𝑋 dom (𝑔𝑓)) = (𝑔𝑋 dom (𝑔𝑓))
4039fnmpt 6641 . . . . . . . 8 (∀𝑔𝑋 dom (𝑔𝑓) ∈ V → (𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋)
4138, 40syl 17 . . . . . . 7 ((𝜑𝑓𝑋) → (𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋)
42 dffn4 6762 . . . . . . 7 ((𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋 ↔ (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓)))
4341, 42sylib 217 . . . . . 6 ((𝜑𝑓𝑋) → (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓)))
44 fonum 9994 . . . . . 6 ((𝑋 ∈ dom card ∧ (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓))) → ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card)
4522, 43, 44syl2anc 584 . . . . 5 ((𝜑𝑓𝑋) → ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card)
46 ssdif0 4323 . . . . . . . . . . . 12 ( (𝐹𝑘) ⊆ {(𝑓𝑘)} ↔ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅)
47 simpr 485 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) ⊆ {(𝑓𝑘)})
48 simpr 485 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑓𝑋) → 𝑓𝑋)
4948, 19eleqtrdi 2848 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑓𝑋) → 𝑓X𝑘𝐴 (𝐹𝑘))
50 vex 3449 . . . . . . . . . . . . . . . . . . . . 21 𝑓 ∈ V
5150elixp 8842 . . . . . . . . . . . . . . . . . . . 20 (𝑓X𝑘𝐴 (𝐹𝑘) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘)))
5251simprbi 497 . . . . . . . . . . . . . . . . . . 19 (𝑓X𝑘𝐴 (𝐹𝑘) → ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘))
5349, 52syl 17 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑓𝑋) → ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘))
5453r19.21bi 3234 . . . . . . . . . . . . . . . . 17 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (𝑓𝑘) ∈ (𝐹𝑘))
5554snssd 4769 . . . . . . . . . . . . . . . 16 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → {(𝑓𝑘)} ⊆ (𝐹𝑘))
5655adantr 481 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → {(𝑓𝑘)} ⊆ (𝐹𝑘))
5747, 56eqssd 3961 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) = {(𝑓𝑘)})
58 fvex 6855 . . . . . . . . . . . . . . 15 (𝑓𝑘) ∈ V
5958ensn1 8961 . . . . . . . . . . . . . 14 {(𝑓𝑘)} ≈ 1o
6057, 59eqbrtrdi 5144 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) ≈ 1o)
6160ex 413 . . . . . . . . . . . 12 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → ( (𝐹𝑘) ⊆ {(𝑓𝑘)} → (𝐹𝑘) ≈ 1o))
6246, 61biimtrrid 242 . . . . . . . . . . 11 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅ → (𝐹𝑘) ≈ 1o))
6362con3d 152 . . . . . . . . . 10 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ¬ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅))
64 neq0 4305 . . . . . . . . . 10 (¬ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅ ↔ ∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}))
6563, 64syl6ib 250 . . . . . . . . 9 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})))
66 eldifi 4086 . . . . . . . . . . . . 13 (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → 𝑥 (𝐹𝑘))
67 simplr 767 . . . . . . . . . . . . . . . . . 18 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → 𝑥 (𝐹𝑘))
68 iftrue 4492 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = 𝑥)
6968, 17eleq12d 2832 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑘 → (if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛) ↔ 𝑥 (𝐹𝑘)))
7067, 69syl5ibrcom 246 . . . . . . . . . . . . . . . . 17 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
7148, 15eleqtrdi 2848 . . . . . . . . . . . . . . . . . . . . 21 ((𝜑𝑓𝑋) → 𝑓X𝑛𝐴 (𝐹𝑛))
7250elixp 8842 . . . . . . . . . . . . . . . . . . . . . 22 (𝑓X𝑛𝐴 (𝐹𝑛) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛)))
7372simprbi 497 . . . . . . . . . . . . . . . . . . . . 21 (𝑓X𝑛𝐴 (𝐹𝑛) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7471, 73syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑓𝑋) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7574ad2antrr 724 . . . . . . . . . . . . . . . . . . 19 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7675r19.21bi 3234 . . . . . . . . . . . . . . . . . 18 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (𝑓𝑛) ∈ (𝐹𝑛))
77 iffalse 4495 . . . . . . . . . . . . . . . . . . 19 𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = (𝑓𝑛))
7877eleq1d 2822 . . . . . . . . . . . . . . . . . 18 𝑛 = 𝑘 → (if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛) ↔ (𝑓𝑛) ∈ (𝐹𝑛)))
7976, 78syl5ibrcom 246 . . . . . . . . . . . . . . . . 17 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (¬ 𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8070, 79pm2.61d 179 . . . . . . . . . . . . . . . 16 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛))
8180ralrimiva 3143 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛))
82 ptcmp.3 . . . . . . . . . . . . . . . . 17 (𝜑𝐴𝑉)
8382ad3antrrr 728 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → 𝐴𝑉)
84 mptelixpg 8873 . . . . . . . . . . . . . . . 16 (𝐴𝑉 → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛) ↔ ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8583, 84syl 17 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛) ↔ ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8681, 85mpbird 256 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛))
8786, 15eleqtrrdi 2849 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋)
8866, 87sylan2 593 . . . . . . . . . . . 12 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋)
89 unisnv 4888 . . . . . . . . . . . . 13 {𝑘} = 𝑘
90 simplr 767 . . . . . . . . . . . . . . . . . . . 20 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑘𝐴)
91 eleq1w 2820 . . . . . . . . . . . . . . . . . . . 20 (𝑚 = 𝑘 → (𝑚𝐴𝑘𝐴))
9290, 91syl5ibrcom 246 . . . . . . . . . . . . . . . . . . 19 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘𝑚𝐴))
9392pm4.71rd 563 . . . . . . . . . . . . . . . . . 18 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘 ↔ (𝑚𝐴𝑚 = 𝑘)))
94 equequ1 2028 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 = 𝑚 → (𝑛 = 𝑘𝑚 = 𝑘))
95 fveq2 6842 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 = 𝑚 → (𝑓𝑛) = (𝑓𝑚))
9694, 95ifbieq2d 4512 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 = 𝑚 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)))
97 eqid 2736 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))
98 vex 3449 . . . . . . . . . . . . . . . . . . . . . . . 24 𝑥 ∈ V
99 fvex 6855 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑓𝑚) ∈ V
10098, 99ifex 4536 . . . . . . . . . . . . . . . . . . . . . . 23 if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ∈ V
10196, 97, 100fvmpt 6948 . . . . . . . . . . . . . . . . . . . . . 22 (𝑚𝐴 → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) = if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)))
102101neeq1d 3003 . . . . . . . . . . . . . . . . . . . . 21 (𝑚𝐴 → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
103102adantl 482 . . . . . . . . . . . . . . . . . . . 20 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
104 iffalse 4495 . . . . . . . . . . . . . . . . . . . . . 22 𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) = (𝑓𝑚))
105104necon1ai 2971 . . . . . . . . . . . . . . . . . . . . 21 (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) → 𝑚 = 𝑘)
106 eldifsni 4750 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → 𝑥 ≠ (𝑓𝑘))
107106ad2antlr 725 . . . . . . . . . . . . . . . . . . . . . 22 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → 𝑥 ≠ (𝑓𝑘))
108 iftrue 4492 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) = 𝑥)
109 fveq2 6842 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = 𝑘 → (𝑓𝑚) = (𝑓𝑘))
110108, 109neeq12d 3005 . . . . . . . . . . . . . . . . . . . . . 22 (𝑚 = 𝑘 → (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) ↔ 𝑥 ≠ (𝑓𝑘)))
111107, 110syl5ibrcom 246 . . . . . . . . . . . . . . . . . . . . 21 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
112105, 111impbid2 225 . . . . . . . . . . . . . . . . . . . 20 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) ↔ 𝑚 = 𝑘))
113103, 112bitrd 278 . . . . . . . . . . . . . . . . . . 19 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ 𝑚 = 𝑘))
114113pm5.32da 579 . . . . . . . . . . . . . . . . . 18 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → ((𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)) ↔ (𝑚𝐴𝑚 = 𝑘)))
11593, 114bitr4d 281 . . . . . . . . . . . . . . . . 17 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘 ↔ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))))
116115abbidv 2805 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑚𝑚 = 𝑘} = {𝑚 ∣ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))})
117 df-sn 4587 . . . . . . . . . . . . . . . 16 {𝑘} = {𝑚𝑚 = 𝑘}
118 df-rab 3408 . . . . . . . . . . . . . . . 16 {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)} = {𝑚 ∣ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))}
119116, 117, 1183eqtr4g 2801 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
120 fvex 6855 . . . . . . . . . . . . . . . . . . 19 (𝑓𝑛) ∈ V
12198, 120ifex 4536 . . . . . . . . . . . . . . . . . 18 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V
122121rgenw 3068 . . . . . . . . . . . . . . . . 17 𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V
12397fnmpt 6641 . . . . . . . . . . . . . . . . 17 (∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴)
124122, 123mp1i 13 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴)
125 ixpfn 8841 . . . . . . . . . . . . . . . . . 18 (𝑓X𝑛𝐴 (𝐹𝑛) → 𝑓 Fn 𝐴)
12671, 125syl 17 . . . . . . . . . . . . . . . . 17 ((𝜑𝑓𝑋) → 𝑓 Fn 𝐴)
127126ad2antrr 724 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑓 Fn 𝐴)
128 fndmdif 6992 . . . . . . . . . . . . . . . 16 (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴𝑓 Fn 𝐴) → dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓) = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
129124, 127, 128syl2anc 584 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓) = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
130119, 129eqtr4d 2779 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
131130unieqd 4879 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
13289, 131eqtr3id 2790 . . . . . . . . . . . 12 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑘 = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
133 difeq1 4075 . . . . . . . . . . . . . . 15 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → (𝑔𝑓) = ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
134133dmeqd 5861 . . . . . . . . . . . . . 14 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → dom (𝑔𝑓) = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
135134unieqd 4879 . . . . . . . . . . . . 13 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → dom (𝑔𝑓) = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
136135rspceeqv 3595 . . . . . . . . . . . 12 (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋𝑘 = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓)) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
13788, 132, 136syl2anc 584 . . . . . . . . . . 11 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
138137ex 413 . . . . . . . . . 10 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
139138exlimdv 1936 . . . . . . . . 9 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
14065, 139syld 47 . . . . . . . 8 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
141140expimpd 454 . . . . . . 7 ((𝜑𝑓𝑋) → ((𝑘𝐴 ∧ ¬ (𝐹𝑘) ≈ 1o) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
14217breq1d 5115 . . . . . . . . 9 (𝑛 = 𝑘 → ( (𝐹𝑛) ≈ 1o (𝐹𝑘) ≈ 1o))
143142notbid 317 . . . . . . . 8 (𝑛 = 𝑘 → (¬ (𝐹𝑛) ≈ 1o ↔ ¬ (𝐹𝑘) ≈ 1o))
144143elrab 3645 . . . . . . 7 (𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ↔ (𝑘𝐴 ∧ ¬ (𝐹𝑘) ≈ 1o))
14539elrnmpt 5911 . . . . . . . 8 (𝑘 ∈ V → (𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓)) ↔ ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
146145elv 3451 . . . . . . 7 (𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓)) ↔ ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
147141, 144, 1463imtr4g 295 . . . . . 6 ((𝜑𝑓𝑋) → (𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} → 𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓))))
148147ssrdv 3950 . . . . 5 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ ran (𝑔𝑋 dom (𝑔𝑓)))
149 ssnum 9975 . . . . 5 ((ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card ∧ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ ran (𝑔𝑋 dom (𝑔𝑓))) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card)
15045, 148, 149syl2anc 584 . . . 4 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card)
151 xpnum 9887 . . . 4 ((X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card ∧ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card) → (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card)
15231, 150, 151syl2anc 584 . . 3 ((𝜑𝑓𝑋) → (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card)
15382adantr 481 . . . . 5 ((𝜑𝑓𝑋) → 𝐴𝑉)
154 rabexg 5288 . . . . 5 (𝐴𝑉 → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V)
155153, 154syl 17 . . . 4 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V)
156 fvex 6855 . . . . . . 7 (𝐹𝑘) ∈ V
157156uniex 7678 . . . . . 6 (𝐹𝑘) ∈ V
158157rgenw 3068 . . . . 5 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V
159 iunexg 7896 . . . . 5 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V ∧ ∀𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V)
160155, 158, 159sylancl 586 . . . 4 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V)
161 resixp 8871 . . . . . 6 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴𝑓X𝑘𝐴 (𝐹𝑘)) → (𝑓 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
16224, 49, 161sylancr 587 . . . . 5 ((𝜑𝑓𝑋) → (𝑓 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
163162ne0d 4295 . . . 4 ((𝜑𝑓𝑋) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≠ ∅)
164 ixpiunwdom 9526 . . . 4 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V ∧ 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V ∧ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≠ ∅) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
165155, 160, 163, 164syl3anc 1371 . . 3 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
166 numwdom 9995 . . 3 (((X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card ∧ 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
167152, 165, 166syl2anc 584 . 2 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
16814, 167exlimddv 1938 1 (𝜑 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  {cab 2713  wne 2943  wral 3064  wrex 3073  {crab 3407  Vcvv 3445  cdif 3907  cin 3909  wss 3910  c0 4282  ifcif 4486  𝒫 cpw 4560  {csn 4586   cuni 4865   ciun 4954   class class class wbr 5105  cmpt 5188   × cxp 5631  ccnv 5632  dom cdm 5633  ran crn 5634  cres 5635  cima 5636   Fn wfn 6491  wf 6492  ontowfo 6494  cfv 6496  cmpo 7359  1oc1o 8405  Xcixp 8835  cen 8880  Fincfn 8883  * cwdom 9500  cardccrd 9871  Compccmp 22737  UFLcufl 23251
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-oadd 8416  df-omul 8417  df-er 8648  df-map 8767  df-ixp 8836  df-en 8884  df-dom 8885  df-fin 8887  df-wdom 9501  df-card 9875  df-acn 9878
This theorem is referenced by:  ptcmplem3  23405
  Copyright terms: Public domain W3C validator