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

Theorem rescabs 17105
Description: Restriction absorption law. (Contributed by Mario Carneiro, 6-Jan-2017.)
Hypotheses
Ref Expression
rescabs.c (𝜑𝐶𝑉)
rescabs.h (𝜑𝐻 Fn (𝑆 × 𝑆))
rescabs.j (𝜑𝐽 Fn (𝑇 × 𝑇))
rescabs.s (𝜑𝑆𝑊)
rescabs.t (𝜑𝑇𝑆)
Assertion
Ref Expression
rescabs (𝜑 → ((𝐶cat 𝐻) ↾cat 𝐽) = (𝐶cat 𝐽))

Proof of Theorem rescabs
StepHypRef Expression
1 eqid 2823 . . . 4 (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾cat 𝐽) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾cat 𝐽)
2 ovexd 7193 . . . 4 (𝜑 → ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V)
3 rescabs.s . . . . 5 (𝜑𝑆𝑊)
4 rescabs.t . . . . 5 (𝜑𝑇𝑆)
53, 4ssexd 5230 . . . 4 (𝜑𝑇 ∈ V)
6 rescabs.j . . . 4 (𝜑𝐽 Fn (𝑇 × 𝑇))
71, 2, 5, 6rescval2 17100 . . 3 (𝜑 → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾cat 𝐽) = ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
8 simpr 487 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (Base‘(𝐶s 𝑆)) ⊆ 𝑇)
9 ovexd 7193 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V)
105adantr 483 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑇 ∈ V)
11 eqid 2823 . . . . . . . 8 (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇)
12 baseid 16545 . . . . . . . . 9 Base = Slot (Base‘ndx)
13 1re 10643 . . . . . . . . . . 11 1 ∈ ℝ
14 1nn 11651 . . . . . . . . . . . 12 1 ∈ ℕ
15 4nn0 11919 . . . . . . . . . . . 12 4 ∈ ℕ0
16 1nn0 11916 . . . . . . . . . . . 12 1 ∈ ℕ0
17 1lt10 12240 . . . . . . . . . . . 12 1 < 10
1814, 15, 16, 17declti 12139 . . . . . . . . . . 11 1 < 14
1913, 18ltneii 10755 . . . . . . . . . 10 1 ≠ 14
20 basendx 16549 . . . . . . . . . . 11 (Base‘ndx) = 1
21 homndx 16689 . . . . . . . . . . 11 (Hom ‘ndx) = 14
2220, 21neeq12i 3084 . . . . . . . . . 10 ((Base‘ndx) ≠ (Hom ‘ndx) ↔ 1 ≠ 14)
2319, 22mpbir 233 . . . . . . . . 9 (Base‘ndx) ≠ (Hom ‘ndx)
2412, 23setsnid 16541 . . . . . . . 8 (Base‘(𝐶s 𝑆)) = (Base‘((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩))
2511, 24ressid2 16554 . . . . . . 7 (((Base‘(𝐶s 𝑆)) ⊆ 𝑇 ∧ ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V ∧ 𝑇 ∈ V) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩))
268, 9, 10, 25syl3anc 1367 . . . . . 6 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩))
2726oveq1d 7173 . . . . 5 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩))
28 ovex 7191 . . . . . 6 (𝐶s 𝑆) ∈ V
295, 5xpexd 7476 . . . . . . . 8 (𝜑 → (𝑇 × 𝑇) ∈ V)
30 fnex 6982 . . . . . . . 8 ((𝐽 Fn (𝑇 × 𝑇) ∧ (𝑇 × 𝑇) ∈ V) → 𝐽 ∈ V)
316, 29, 30syl2anc 586 . . . . . . 7 (𝜑𝐽 ∈ V)
3231adantr 483 . . . . . 6 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝐽 ∈ V)
33 setsabs 16528 . . . . . 6 (((𝐶s 𝑆) ∈ V ∧ 𝐽 ∈ V) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐽⟩))
3428, 32, 33sylancr 589 . . . . 5 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐽⟩))
35 eqid 2823 . . . . . . . . . . . . . 14 (𝐶s 𝑆) = (𝐶s 𝑆)
36 eqid 2823 . . . . . . . . . . . . . 14 (Base‘𝐶) = (Base‘𝐶)
3735, 36ressbas 16556 . . . . . . . . . . . . 13 (𝑆𝑊 → (𝑆 ∩ (Base‘𝐶)) = (Base‘(𝐶s 𝑆)))
383, 37syl 17 . . . . . . . . . . . 12 (𝜑 → (𝑆 ∩ (Base‘𝐶)) = (Base‘(𝐶s 𝑆)))
3938sseq1d 4000 . . . . . . . . . . 11 (𝜑 → ((𝑆 ∩ (Base‘𝐶)) ⊆ 𝑇 ↔ (Base‘(𝐶s 𝑆)) ⊆ 𝑇))
4039biimpar 480 . . . . . . . . . 10 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑆 ∩ (Base‘𝐶)) ⊆ 𝑇)
41 inss2 4208 . . . . . . . . . . 11 (𝑆 ∩ (Base‘𝐶)) ⊆ (Base‘𝐶)
4241a1i 11 . . . . . . . . . 10 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑆 ∩ (Base‘𝐶)) ⊆ (Base‘𝐶))
4340, 42ssind 4211 . . . . . . . . 9 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑆 ∩ (Base‘𝐶)) ⊆ (𝑇 ∩ (Base‘𝐶)))
444adantr 483 . . . . . . . . . 10 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑇𝑆)
4544ssrind 4214 . . . . . . . . 9 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑇 ∩ (Base‘𝐶)) ⊆ (𝑆 ∩ (Base‘𝐶)))
4643, 45eqssd 3986 . . . . . . . 8 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑆 ∩ (Base‘𝐶)) = (𝑇 ∩ (Base‘𝐶)))
4746oveq2d 7174 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝐶s (𝑆 ∩ (Base‘𝐶))) = (𝐶s (𝑇 ∩ (Base‘𝐶))))
483adantr 483 . . . . . . . 8 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑆𝑊)
4936ressinbas 16562 . . . . . . . 8 (𝑆𝑊 → (𝐶s 𝑆) = (𝐶s (𝑆 ∩ (Base‘𝐶))))
5048, 49syl 17 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝐶s 𝑆) = (𝐶s (𝑆 ∩ (Base‘𝐶))))
5136ressinbas 16562 . . . . . . . 8 (𝑇 ∈ V → (𝐶s 𝑇) = (𝐶s (𝑇 ∩ (Base‘𝐶))))
5210, 51syl 17 . . . . . . 7 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝐶s 𝑇) = (𝐶s (𝑇 ∩ (Base‘𝐶))))
5347, 50, 523eqtr4d 2868 . . . . . 6 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝐶s 𝑆) = (𝐶s 𝑇))
5453oveq1d 7173 . . . . 5 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
5527, 34, 543eqtrd 2862 . . . 4 ((𝜑 ∧ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
56 simpr 487 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇)
57 ovexd 7193 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V)
585adantr 483 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑇 ∈ V)
5911, 24ressval2 16555 . . . . . . . 8 ((¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇 ∧ ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V ∧ 𝑇 ∈ V) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩))
6056, 57, 58, 59syl3anc 1367 . . . . . . 7 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩))
61 ovexd 7193 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝐶s 𝑆) ∈ V)
6223necomi 3072 . . . . . . . . 9 (Hom ‘ndx) ≠ (Base‘ndx)
6362a1i 11 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (Hom ‘ndx) ≠ (Base‘ndx))
64 rescabs.h . . . . . . . . . 10 (𝜑𝐻 Fn (𝑆 × 𝑆))
653, 3xpexd 7476 . . . . . . . . . 10 (𝜑 → (𝑆 × 𝑆) ∈ V)
66 fnex 6982 . . . . . . . . . 10 ((𝐻 Fn (𝑆 × 𝑆) ∧ (𝑆 × 𝑆) ∈ V) → 𝐻 ∈ V)
6764, 65, 66syl2anc 586 . . . . . . . . 9 (𝜑𝐻 ∈ V)
6867adantr 483 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝐻 ∈ V)
69 fvex 6685 . . . . . . . . . 10 (Base‘(𝐶s 𝑆)) ∈ V
7069inex2 5224 . . . . . . . . 9 (𝑇 ∩ (Base‘(𝐶s 𝑆))) ∈ V
7170a1i 11 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (𝑇 ∩ (Base‘(𝐶s 𝑆))) ∈ V)
72 fvex 6685 . . . . . . . . 9 (Hom ‘ndx) ∈ V
73 fvex 6685 . . . . . . . . 9 (Base‘ndx) ∈ V
7472, 73setscom 16529 . . . . . . . 8 ((((𝐶s 𝑆) ∈ V ∧ (Hom ‘ndx) ≠ (Base‘ndx)) ∧ (𝐻 ∈ V ∧ (𝑇 ∩ (Base‘(𝐶s 𝑆))) ∈ V)) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) = (((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) sSet ⟨(Hom ‘ndx), 𝐻⟩))
7561, 63, 68, 71, 74syl22anc 836 . . . . . . 7 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) = (((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) sSet ⟨(Hom ‘ndx), 𝐻⟩))
76 eqid 2823 . . . . . . . . . . 11 ((𝐶s 𝑆) ↾s 𝑇) = ((𝐶s 𝑆) ↾s 𝑇)
77 eqid 2823 . . . . . . . . . . 11 (Base‘(𝐶s 𝑆)) = (Base‘(𝐶s 𝑆))
7876, 77ressval2 16555 . . . . . . . . . 10 ((¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇 ∧ (𝐶s 𝑆) ∈ V ∧ 𝑇 ∈ V) → ((𝐶s 𝑆) ↾s 𝑇) = ((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩))
7956, 61, 58, 78syl3anc 1367 . . . . . . . . 9 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) ↾s 𝑇) = ((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩))
803adantr 483 . . . . . . . . . 10 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑆𝑊)
814adantr 483 . . . . . . . . . 10 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝑇𝑆)
82 ressabs 16565 . . . . . . . . . 10 ((𝑆𝑊𝑇𝑆) → ((𝐶s 𝑆) ↾s 𝑇) = (𝐶s 𝑇))
8380, 81, 82syl2anc 586 . . . . . . . . 9 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) ↾s 𝑇) = (𝐶s 𝑇))
8479, 83eqtr3d 2860 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) = (𝐶s 𝑇))
8584oveq1d 7173 . . . . . . 7 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Base‘ndx), (𝑇 ∩ (Base‘(𝐶s 𝑆)))⟩) sSet ⟨(Hom ‘ndx), 𝐻⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐻⟩))
8660, 75, 853eqtrd 2862 . . . . . 6 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐻⟩))
8786oveq1d 7173 . . . . 5 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩) = (((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩))
88 ovex 7191 . . . . . 6 (𝐶s 𝑇) ∈ V
8931adantr 483 . . . . . 6 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → 𝐽 ∈ V)
90 setsabs 16528 . . . . . 6 (((𝐶s 𝑇) ∈ V ∧ 𝐽 ∈ V) → (((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
9188, 89, 90sylancr 589 . . . . 5 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → (((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐻⟩) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
9287, 91eqtrd 2858 . . . 4 ((𝜑 ∧ ¬ (Base‘(𝐶s 𝑆)) ⊆ 𝑇) → ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
9355, 92pm2.61dan 811 . . 3 (𝜑 → ((((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
947, 93eqtrd 2858 . 2 (𝜑 → (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾cat 𝐽) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
95 eqid 2823 . . . 4 (𝐶cat 𝐻) = (𝐶cat 𝐻)
96 rescabs.c . . . 4 (𝜑𝐶𝑉)
9795, 96, 3, 64rescval2 17100 . . 3 (𝜑 → (𝐶cat 𝐻) = ((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩))
9897oveq1d 7173 . 2 (𝜑 → ((𝐶cat 𝐻) ↾cat 𝐽) = (((𝐶s 𝑆) sSet ⟨(Hom ‘ndx), 𝐻⟩) ↾cat 𝐽))
99 eqid 2823 . . 3 (𝐶cat 𝐽) = (𝐶cat 𝐽)
10099, 96, 5, 6rescval2 17100 . 2 (𝜑 → (𝐶cat 𝐽) = ((𝐶s 𝑇) sSet ⟨(Hom ‘ndx), 𝐽⟩))
10194, 98, 1003eqtr4d 2868 1 (𝜑 → ((𝐶cat 𝐻) ↾cat 𝐽) = (𝐶cat 𝐽))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1537  wcel 2114  wne 3018  Vcvv 3496  cin 3937  wss 3938  cop 4575   × cxp 5555   Fn wfn 6352  cfv 6357  (class class class)co 7158  1c1 10540  4c4 11697  cdc 12101  ndxcnx 16482   sSet csts 16483  Basecbs 16485  s cress 16486  Hom chom 16578  cat cresc 17080
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-9 11710  df-n0 11901  df-z 11985  df-dec 12102  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-hom 16591  df-resc 17083
This theorem is referenced by:  subsubc  17125  fldc  44361  fldcALTV  44379
  Copyright terms: Public domain W3C validator