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

Theorem ptcmplem2 23951
Description: Lemma for ptcmp 23956. (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 4393 . . . . . . 7 ∅ ⊆ 𝑈
3 0fin 9190 . . . . . . 7 ∅ ∈ Fin
4 elfpw 9373 . . . . . . 7 (∅ ∈ (𝒫 𝑈 ∩ Fin) ↔ (∅ ⊆ 𝑈 ∧ ∅ ∈ Fin))
52, 3, 4mpbir2an 710 . . . . . 6 ∅ ∈ (𝒫 𝑈 ∩ Fin)
6 unieq 4915 . . . . . . . 8 (𝑧 = ∅ → 𝑧 = ∅)
7 uni0 4934 . . . . . . . 8 ∅ = ∅
86, 7eqtrdi 2784 . . . . . . 7 (𝑧 = ∅ → 𝑧 = ∅)
98rspceeqv 3630 . . . . . 6 ((∅ ∈ (𝒫 𝑈 ∩ Fin) ∧ 𝑋 = ∅) → ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
105, 9mpan 689 . . . . 5 (𝑋 = ∅ → ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧)
1110necon3bi 2963 . . . 4 (¬ ∃𝑧 ∈ (𝒫 𝑈 ∩ Fin)𝑋 = 𝑧𝑋 ≠ ∅)
121, 11syl 17 . . 3 (𝜑𝑋 ≠ ∅)
13 n0 4343 . . 3 (𝑋 ≠ ∅ ↔ ∃𝑓 𝑓𝑋)
1412, 13sylib 217 . 2 (𝜑 → ∃𝑓 𝑓𝑋)
15 ptcmp.2 . . . . . . 7 𝑋 = X𝑛𝐴 (𝐹𝑛)
16 fveq2 6892 . . . . . . . . 9 (𝑛 = 𝑘 → (𝐹𝑛) = (𝐹𝑘))
1716unieqd 4917 . . . . . . . 8 (𝑛 = 𝑘 (𝐹𝑛) = (𝐹𝑘))
1817cbvixpv 8928 . . . . . . 7 X𝑛𝐴 (𝐹𝑛) = X𝑘𝐴 (𝐹𝑘)
1915, 18eqtri 2756 . . . . . 6 𝑋 = X𝑘𝐴 (𝐹𝑘)
20 ptcmp.5 . . . . . . . 8 (𝜑𝑋 ∈ (UFL ∩ dom card))
2120elin2d 4196 . . . . . . 7 (𝜑𝑋 ∈ dom card)
2221adantr 480 . . . . . 6 ((𝜑𝑓𝑋) → 𝑋 ∈ dom card)
2319, 22eqeltrrid 2834 . . . . 5 ((𝜑𝑓𝑋) → X𝑘𝐴 (𝐹𝑘) ∈ dom card)
24 ssrab2 4074 . . . . . 6 {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴
2512adantr 480 . . . . . . 7 ((𝜑𝑓𝑋) → 𝑋 ≠ ∅)
2619, 25eqnetrrid 3012 . . . . . 6 ((𝜑𝑓𝑋) → X𝑘𝐴 (𝐹𝑘) ≠ ∅)
27 eqid 2728 . . . . . . 7 (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})) = (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
2827resixpfo 8949 . . . . . 6 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴X𝑘𝐴 (𝐹𝑘) ≠ ∅) → (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
2924, 26, 28sylancr 586 . . . . 5 ((𝜑𝑓𝑋) → (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
30 fonum 10076 . . . . 5 ((X𝑘𝐴 (𝐹𝑘) ∈ dom card ∧ (𝑔X𝑘𝐴 (𝐹𝑘) ↦ (𝑔 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})):X𝑘𝐴 (𝐹𝑘)–ontoX𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘)) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
3123, 29, 30syl2anc 583 . . . 4 ((𝜑𝑓𝑋) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
32 vex 3474 . . . . . . . . . . 11 𝑔 ∈ V
33 difexg 5324 . . . . . . . . . . 11 (𝑔 ∈ V → (𝑔𝑓) ∈ V)
3432, 33mp1i 13 . . . . . . . . . 10 ((𝜑𝑓𝑋) → (𝑔𝑓) ∈ V)
35 dmexg 7904 . . . . . . . . . 10 ((𝑔𝑓) ∈ V → dom (𝑔𝑓) ∈ V)
36 uniexg 7740 . . . . . . . . . 10 (dom (𝑔𝑓) ∈ V → dom (𝑔𝑓) ∈ V)
3734, 35, 363syl 18 . . . . . . . . 9 ((𝜑𝑓𝑋) → dom (𝑔𝑓) ∈ V)
3837ralrimivw 3146 . . . . . . . 8 ((𝜑𝑓𝑋) → ∀𝑔𝑋 dom (𝑔𝑓) ∈ V)
39 eqid 2728 . . . . . . . . 9 (𝑔𝑋 dom (𝑔𝑓)) = (𝑔𝑋 dom (𝑔𝑓))
4039fnmpt 6690 . . . . . . . 8 (∀𝑔𝑋 dom (𝑔𝑓) ∈ V → (𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋)
4138, 40syl 17 . . . . . . 7 ((𝜑𝑓𝑋) → (𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋)
42 dffn4 6812 . . . . . . 7 ((𝑔𝑋 dom (𝑔𝑓)) Fn 𝑋 ↔ (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓)))
4341, 42sylib 217 . . . . . 6 ((𝜑𝑓𝑋) → (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓)))
44 fonum 10076 . . . . . 6 ((𝑋 ∈ dom card ∧ (𝑔𝑋 dom (𝑔𝑓)):𝑋onto→ran (𝑔𝑋 dom (𝑔𝑓))) → ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card)
4522, 43, 44syl2anc 583 . . . . 5 ((𝜑𝑓𝑋) → ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card)
46 ssdif0 4360 . . . . . . . . . . . 12 ( (𝐹𝑘) ⊆ {(𝑓𝑘)} ↔ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅)
47 simpr 484 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) ⊆ {(𝑓𝑘)})
48 simpr 484 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑓𝑋) → 𝑓𝑋)
4948, 19eleqtrdi 2839 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑓𝑋) → 𝑓X𝑘𝐴 (𝐹𝑘))
50 vex 3474 . . . . . . . . . . . . . . . . . . . . 21 𝑓 ∈ V
5150elixp 8917 . . . . . . . . . . . . . . . . . . . 20 (𝑓X𝑘𝐴 (𝐹𝑘) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘)))
5251simprbi 496 . . . . . . . . . . . . . . . . . . 19 (𝑓X𝑘𝐴 (𝐹𝑘) → ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘))
5349, 52syl 17 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑓𝑋) → ∀𝑘𝐴 (𝑓𝑘) ∈ (𝐹𝑘))
5453r19.21bi 3244 . . . . . . . . . . . . . . . . 17 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (𝑓𝑘) ∈ (𝐹𝑘))
5554snssd 4809 . . . . . . . . . . . . . . . 16 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → {(𝑓𝑘)} ⊆ (𝐹𝑘))
5655adantr 480 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → {(𝑓𝑘)} ⊆ (𝐹𝑘))
5747, 56eqssd 3996 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) = {(𝑓𝑘)})
58 fvex 6905 . . . . . . . . . . . . . . 15 (𝑓𝑘) ∈ V
5958ensn1 9036 . . . . . . . . . . . . . 14 {(𝑓𝑘)} ≈ 1o
6057, 59eqbrtrdi 5182 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ (𝐹𝑘) ⊆ {(𝑓𝑘)}) → (𝐹𝑘) ≈ 1o)
6160ex 412 . . . . . . . . . . . 12 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → ( (𝐹𝑘) ⊆ {(𝑓𝑘)} → (𝐹𝑘) ≈ 1o))
6246, 61biimtrrid 242 . . . . . . . . . . 11 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅ → (𝐹𝑘) ≈ 1o))
6362con3d 152 . . . . . . . . . 10 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ¬ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅))
64 neq0 4342 . . . . . . . . . 10 (¬ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) = ∅ ↔ ∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}))
6563, 64imbitrdi 250 . . . . . . . . 9 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})))
66 eldifi 4123 . . . . . . . . . . . . 13 (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → 𝑥 (𝐹𝑘))
67 simplr 768 . . . . . . . . . . . . . . . . . 18 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → 𝑥 (𝐹𝑘))
68 iftrue 4531 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = 𝑥)
6968, 17eleq12d 2823 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑘 → (if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛) ↔ 𝑥 (𝐹𝑘)))
7067, 69syl5ibrcom 246 . . . . . . . . . . . . . . . . 17 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
7148, 15eleqtrdi 2839 . . . . . . . . . . . . . . . . . . . . 21 ((𝜑𝑓𝑋) → 𝑓X𝑛𝐴 (𝐹𝑛))
7250elixp 8917 . . . . . . . . . . . . . . . . . . . . . 22 (𝑓X𝑛𝐴 (𝐹𝑛) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛)))
7372simprbi 496 . . . . . . . . . . . . . . . . . . . . 21 (𝑓X𝑛𝐴 (𝐹𝑛) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7471, 73syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑓𝑋) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7574ad2antrr 725 . . . . . . . . . . . . . . . . . . 19 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ∀𝑛𝐴 (𝑓𝑛) ∈ (𝐹𝑛))
7675r19.21bi 3244 . . . . . . . . . . . . . . . . . 18 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (𝑓𝑛) ∈ (𝐹𝑛))
77 iffalse 4534 . . . . . . . . . . . . . . . . . . 19 𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = (𝑓𝑛))
7877eleq1d 2814 . . . . . . . . . . . . . . . . . 18 𝑛 = 𝑘 → (if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛) ↔ (𝑓𝑛) ∈ (𝐹𝑛)))
7976, 78syl5ibrcom 246 . . . . . . . . . . . . . . . . 17 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → (¬ 𝑛 = 𝑘 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8070, 79pm2.61d 179 . . . . . . . . . . . . . . . 16 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) ∧ 𝑛𝐴) → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛))
8180ralrimiva 3142 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛))
82 ptcmp.3 . . . . . . . . . . . . . . . . 17 (𝜑𝐴𝑉)
8382ad3antrrr 729 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → 𝐴𝑉)
84 mptelixpg 8948 . . . . . . . . . . . . . . . 16 (𝐴𝑉 → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛) ↔ ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8583, 84syl 17 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛) ↔ ∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ (𝐹𝑛)))
8681, 85mpbird 257 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ X𝑛𝐴 (𝐹𝑛))
8786, 15eleqtrrdi 2840 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 (𝐹𝑘)) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋)
8866, 87sylan2 592 . . . . . . . . . . . 12 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋)
89 unisnv 4926 . . . . . . . . . . . . 13 {𝑘} = 𝑘
90 simplr 768 . . . . . . . . . . . . . . . . . . . 20 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑘𝐴)
91 eleq1w 2812 . . . . . . . . . . . . . . . . . . . 20 (𝑚 = 𝑘 → (𝑚𝐴𝑘𝐴))
9290, 91syl5ibrcom 246 . . . . . . . . . . . . . . . . . . 19 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘𝑚𝐴))
9392pm4.71rd 562 . . . . . . . . . . . . . . . . . 18 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘 ↔ (𝑚𝐴𝑚 = 𝑘)))
94 equequ1 2021 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 = 𝑚 → (𝑛 = 𝑘𝑚 = 𝑘))
95 fveq2 6892 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 = 𝑚 → (𝑓𝑛) = (𝑓𝑚))
9694, 95ifbieq2d 4551 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 = 𝑚 → if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) = if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)))
97 eqid 2728 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))
98 vex 3474 . . . . . . . . . . . . . . . . . . . . . . . 24 𝑥 ∈ V
99 fvex 6905 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑓𝑚) ∈ V
10098, 99ifex 4575 . . . . . . . . . . . . . . . . . . . . . . 23 if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ∈ V
10196, 97, 100fvmpt 7000 . . . . . . . . . . . . . . . . . . . . . 22 (𝑚𝐴 → ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) = if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)))
102101neeq1d 2996 . . . . . . . . . . . . . . . . . . . . 21 (𝑚𝐴 → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
103102adantl 481 . . . . . . . . . . . . . . . . . . . 20 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
104 iffalse 4534 . . . . . . . . . . . . . . . . . . . . . 22 𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) = (𝑓𝑚))
105104necon1ai 2964 . . . . . . . . . . . . . . . . . . . . 21 (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) → 𝑚 = 𝑘)
106 eldifsni 4790 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → 𝑥 ≠ (𝑓𝑘))
107106ad2antlr 726 . . . . . . . . . . . . . . . . . . . . . 22 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → 𝑥 ≠ (𝑓𝑘))
108 iftrue 4531 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) = 𝑥)
109 fveq2 6892 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = 𝑘 → (𝑓𝑚) = (𝑓𝑘))
110108, 109neeq12d 2998 . . . . . . . . . . . . . . . . . . . . . 22 (𝑚 = 𝑘 → (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) ↔ 𝑥 ≠ (𝑓𝑘)))
111107, 110syl5ibrcom 246 . . . . . . . . . . . . . . . . . . . . 21 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (𝑚 = 𝑘 → if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚)))
112105, 111impbid2 225 . . . . . . . . . . . . . . . . . . . 20 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (if(𝑚 = 𝑘, 𝑥, (𝑓𝑚)) ≠ (𝑓𝑚) ↔ 𝑚 = 𝑘))
113103, 112bitrd 279 . . . . . . . . . . . . . . . . . . 19 (((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) ∧ 𝑚𝐴) → (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚) ↔ 𝑚 = 𝑘))
114113pm5.32da 578 . . . . . . . . . . . . . . . . . 18 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → ((𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)) ↔ (𝑚𝐴𝑚 = 𝑘)))
11593, 114bitr4d 282 . . . . . . . . . . . . . . . . 17 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑚 = 𝑘 ↔ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))))
116115abbidv 2797 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑚𝑚 = 𝑘} = {𝑚 ∣ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))})
117 df-sn 4626 . . . . . . . . . . . . . . . 16 {𝑘} = {𝑚𝑚 = 𝑘}
118 df-rab 3429 . . . . . . . . . . . . . . . 16 {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)} = {𝑚 ∣ (𝑚𝐴 ∧ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚))}
119116, 117, 1183eqtr4g 2793 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
120 fvex 6905 . . . . . . . . . . . . . . . . . . 19 (𝑓𝑛) ∈ V
12198, 120ifex 4575 . . . . . . . . . . . . . . . . . 18 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V
122121rgenw 3061 . . . . . . . . . . . . . . . . 17 𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V
12397fnmpt 6690 . . . . . . . . . . . . . . . . 17 (∀𝑛𝐴 if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)) ∈ V → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴)
124122, 123mp1i 13 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴)
125 ixpfn 8916 . . . . . . . . . . . . . . . . . 18 (𝑓X𝑛𝐴 (𝐹𝑛) → 𝑓 Fn 𝐴)
12671, 125syl 17 . . . . . . . . . . . . . . . . 17 ((𝜑𝑓𝑋) → 𝑓 Fn 𝐴)
127126ad2antrr 725 . . . . . . . . . . . . . . . 16 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑓 Fn 𝐴)
128 fndmdif 7046 . . . . . . . . . . . . . . . 16 (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) Fn 𝐴𝑓 Fn 𝐴) → dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓) = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
129124, 127, 128syl2anc 583 . . . . . . . . . . . . . . 15 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓) = {𝑚𝐴 ∣ ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛)))‘𝑚) ≠ (𝑓𝑚)})
130119, 129eqtr4d 2771 . . . . . . . . . . . . . 14 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
131130unieqd 4917 . . . . . . . . . . . . 13 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → {𝑘} = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
13289, 131eqtr3id 2782 . . . . . . . . . . . 12 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → 𝑘 = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
133 difeq1 4112 . . . . . . . . . . . . . . 15 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → (𝑔𝑓) = ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
134133dmeqd 5903 . . . . . . . . . . . . . 14 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → dom (𝑔𝑓) = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
135134unieqd 4917 . . . . . . . . . . . . 13 (𝑔 = (𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) → dom (𝑔𝑓) = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓))
136135rspceeqv 3630 . . . . . . . . . . . 12 (((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∈ 𝑋𝑘 = dom ((𝑛𝐴 ↦ if(𝑛 = 𝑘, 𝑥, (𝑓𝑛))) ∖ 𝑓)) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
13788, 132, 136syl2anc 583 . . . . . . . . . . 11 ((((𝜑𝑓𝑋) ∧ 𝑘𝐴) ∧ 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)})) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
138137ex 412 . . . . . . . . . 10 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
139138exlimdv 1929 . . . . . . . . 9 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (∃𝑥 𝑥 ∈ ( (𝐹𝑘) ∖ {(𝑓𝑘)}) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
14065, 139syld 47 . . . . . . . 8 (((𝜑𝑓𝑋) ∧ 𝑘𝐴) → (¬ (𝐹𝑘) ≈ 1o → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
141140expimpd 453 . . . . . . 7 ((𝜑𝑓𝑋) → ((𝑘𝐴 ∧ ¬ (𝐹𝑘) ≈ 1o) → ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
14217breq1d 5153 . . . . . . . . 9 (𝑛 = 𝑘 → ( (𝐹𝑛) ≈ 1o (𝐹𝑘) ≈ 1o))
143142notbid 318 . . . . . . . 8 (𝑛 = 𝑘 → (¬ (𝐹𝑛) ≈ 1o ↔ ¬ (𝐹𝑘) ≈ 1o))
144143elrab 3681 . . . . . . 7 (𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ↔ (𝑘𝐴 ∧ ¬ (𝐹𝑘) ≈ 1o))
14539elrnmpt 5953 . . . . . . . 8 (𝑘 ∈ V → (𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓)) ↔ ∃𝑔𝑋 𝑘 = dom (𝑔𝑓)))
146145elv 3476 . . . . . . 7 (𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓)) ↔ ∃𝑔𝑋 𝑘 = dom (𝑔𝑓))
147141, 144, 1463imtr4g 296 . . . . . 6 ((𝜑𝑓𝑋) → (𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} → 𝑘 ∈ ran (𝑔𝑋 dom (𝑔𝑓))))
148147ssrdv 3985 . . . . 5 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ ran (𝑔𝑋 dom (𝑔𝑓)))
149 ssnum 10057 . . . . 5 ((ran (𝑔𝑋 dom (𝑔𝑓)) ∈ dom card ∧ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ ran (𝑔𝑋 dom (𝑔𝑓))) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card)
15045, 148, 149syl2anc 583 . . . 4 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card)
151 xpnum 9969 . . . 4 ((X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card ∧ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ dom card) → (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card)
15231, 150, 151syl2anc 583 . . 3 ((𝜑𝑓𝑋) → (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card)
15382adantr 480 . . . . 5 ((𝜑𝑓𝑋) → 𝐴𝑉)
154 rabexg 5328 . . . . 5 (𝐴𝑉 → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V)
155153, 154syl 17 . . . 4 ((𝜑𝑓𝑋) → {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V)
156 fvex 6905 . . . . . . 7 (𝐹𝑘) ∈ V
157156uniex 7741 . . . . . 6 (𝐹𝑘) ∈ V
158157rgenw 3061 . . . . 5 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V
159 iunexg 7962 . . . . 5 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V ∧ ∀𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V)
160155, 158, 159sylancl 585 . . . 4 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V)
161 resixp 8946 . . . . . 6 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ⊆ 𝐴𝑓X𝑘𝐴 (𝐹𝑘)) → (𝑓 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
16224, 49, 161sylancr 586 . . . . 5 ((𝜑𝑓𝑋) → (𝑓 ↾ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘))
163162ne0d 4332 . . . 4 ((𝜑𝑓𝑋) → X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≠ ∅)
164 ixpiunwdom 9608 . . . 4 (({𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} ∈ V ∧ 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ V ∧ X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≠ ∅) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
165155, 160, 163, 164syl3anc 1369 . . 3 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}))
166 numwdom 10077 . . 3 (((X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o}) ∈ dom card ∧ 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ≼* (X𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) × {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o})) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
167152, 165, 166syl2anc 583 . 2 ((𝜑𝑓𝑋) → 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
16814, 167exlimddv 1931 1 (𝜑 𝑘 ∈ {𝑛𝐴 ∣ ¬ (𝐹𝑛) ≈ 1o} (𝐹𝑘) ∈ dom card)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1534  wex 1774  wcel 2099  {cab 2705  wne 2936  wral 3057  wrex 3066  {crab 3428  Vcvv 3470  cdif 3942  cin 3944  wss 3945  c0 4319  ifcif 4525  𝒫 cpw 4599  {csn 4625   cuni 4904   ciun 4992   class class class wbr 5143  cmpt 5226   × cxp 5671  ccnv 5672  dom cdm 5673  ran crn 5674  cres 5675  cima 5676   Fn wfn 6538  wf 6539  ontowfo 6541  cfv 6543  cmpo 7417  1oc1o 8474  Xcixp 8910  cen 8955  Fincfn 8958  * cwdom 9582  cardccrd 9953  Compccmp 23284  UFLcufl 23798
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5360  ax-pr 5424  ax-un 7735
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2937  df-ral 3058  df-rex 3067  df-rmo 3372  df-reu 3373  df-rab 3429  df-v 3472  df-sbc 3776  df-csb 3891  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-pss 3964  df-nul 4320  df-if 4526  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4905  df-int 4946  df-iun 4994  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5571  df-eprel 5577  df-po 5585  df-so 5586  df-fr 5628  df-se 5629  df-we 5630  df-xp 5679  df-rel 5680  df-cnv 5681  df-co 5682  df-dm 5683  df-rn 5684  df-res 5685  df-ima 5686  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 7371  df-ov 7418  df-oprab 7419  df-mpo 7420  df-om 7866  df-1st 7988  df-2nd 7989  df-frecs 8281  df-wrecs 8312  df-recs 8386  df-rdg 8425  df-1o 8481  df-oadd 8485  df-omul 8486  df-er 8719  df-map 8841  df-ixp 8911  df-en 8959  df-dom 8960  df-fin 8962  df-wdom 9583  df-card 9957  df-acn 9960
This theorem is referenced by:  ptcmplem3  23952
  Copyright terms: Public domain W3C validator