Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  msubco Structured version   Visualization version   GIF version

Theorem msubco 34125
Description: The composition of two substitutions is a substitution. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypothesis
Ref Expression
msubco.s 𝑆 = (mSubst‘𝑇)
Assertion
Ref Expression
msubco ((𝐹 ∈ ran 𝑆𝐺 ∈ ran 𝑆) → (𝐹𝐺) ∈ ran 𝑆)

Proof of Theorem msubco
Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . . . 5 (mEx‘𝑇) = (mEx‘𝑇)
2 eqid 2736 . . . . 5 (mRSubst‘𝑇) = (mRSubst‘𝑇)
3 msubco.s . . . . 5 𝑆 = (mSubst‘𝑇)
41, 2, 3elmsubrn 34122 . . . 4 ran 𝑆 = ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
54eleq2i 2829 . . 3 (𝐹 ∈ ran 𝑆𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)))
6 eqid 2736 . . . 4 (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)) = (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
7 fvex 6855 . . . . 5 (mEx‘𝑇) ∈ V
87mptex 7173 . . . 4 (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∈ V
96, 8elrnmpti 5915 . . 3 (𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)) ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
105, 9bitri 274 . 2 (𝐹 ∈ ran 𝑆 ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
111, 2, 3elmsubrn 34122 . . . 4 ran 𝑆 = ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
1211eleq2i 2829 . . 3 (𝐺 ∈ ran 𝑆𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
13 eqid 2736 . . . 4 (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
147mptex 7173 . . . 4 (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) ∈ V
1513, 14elrnmpti 5915 . . 3 (𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
1612, 15bitri 274 . 2 (𝐺 ∈ ran 𝑆 ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
17 reeanv 3217 . . 3 (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ↔ (∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
18 simpr 485 . . . . . . . . . . . 12 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ (mEx‘𝑇))
19 eqid 2736 . . . . . . . . . . . . 13 (mTC‘𝑇) = (mTC‘𝑇)
20 eqid 2736 . . . . . . . . . . . . 13 (mREx‘𝑇) = (mREx‘𝑇)
2119, 1, 20mexval 34096 . . . . . . . . . . . 12 (mEx‘𝑇) = ((mTC‘𝑇) × (mREx‘𝑇))
2218, 21eleqtrdi 2848 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
23 xp1st 7953 . . . . . . . . . . 11 (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (1st𝑦) ∈ (mTC‘𝑇))
2422, 23syl 17 . . . . . . . . . 10 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (1st𝑦) ∈ (mTC‘𝑇))
252, 20mrsubf 34111 . . . . . . . . . . . 12 (𝑔 ∈ ran (mRSubst‘𝑇) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
2625ad2antlr 725 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
27 xp2nd 7954 . . . . . . . . . . . 12 (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (2nd𝑦) ∈ (mREx‘𝑇))
2822, 27syl 17 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (2nd𝑦) ∈ (mREx‘𝑇))
2926, 28ffvelcdmd 7036 . . . . . . . . . 10 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (𝑔‘(2nd𝑦)) ∈ (mREx‘𝑇))
30 opelxpi 5670 . . . . . . . . . 10 (((1st𝑦) ∈ (mTC‘𝑇) ∧ (𝑔‘(2nd𝑦)) ∈ (mREx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
3124, 29, 30syl2anc 584 . . . . . . . . 9 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
3231, 21eleqtrrdi 2849 . . . . . . . 8 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ (mEx‘𝑇))
33 eqidd 2737 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
34 eqidd 2737 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
35 fvex 6855 . . . . . . . . . 10 (1st𝑦) ∈ V
36 fvex 6855 . . . . . . . . . 10 (𝑔‘(2nd𝑦)) ∈ V
3735, 36op1std 7931 . . . . . . . . 9 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (1st𝑥) = (1st𝑦))
3835, 36op2ndd 7932 . . . . . . . . . 10 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (2nd𝑥) = (𝑔‘(2nd𝑦)))
3938fveq2d 6846 . . . . . . . . 9 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (𝑓‘(2nd𝑥)) = (𝑓‘(𝑔‘(2nd𝑦))))
4037, 39opeq12d 4838 . . . . . . . 8 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩ = ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩)
4132, 33, 34, 40fmptco 7075 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩))
42 fvco3 6940 . . . . . . . . . 10 ((𝑔:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ (2nd𝑦) ∈ (mREx‘𝑇)) → ((𝑓𝑔)‘(2nd𝑦)) = (𝑓‘(𝑔‘(2nd𝑦))))
4326, 28, 42syl2anc 584 . . . . . . . . 9 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ((𝑓𝑔)‘(2nd𝑦)) = (𝑓‘(𝑔‘(2nd𝑦))))
4443opeq2d 4837 . . . . . . . 8 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩ = ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩)
4544mpteq2dva 5205 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩))
4641, 45eqtr4d 2779 . . . . . 6 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩))
472mrsubco 34115 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑓𝑔) ∈ ran (mRSubst‘𝑇))
487mptex 7173 . . . . . . . 8 (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ V
49 eqid 2736 . . . . . . . . 9 ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)) = ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩))
50 fveq1 6841 . . . . . . . . . . 11 ( = (𝑓𝑔) → (‘(2nd𝑦)) = ((𝑓𝑔)‘(2nd𝑦)))
5150opeq2d 4837 . . . . . . . . . 10 ( = (𝑓𝑔) → ⟨(1st𝑦), (‘(2nd𝑦))⟩ = ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩)
5251mpteq2dv 5207 . . . . . . . . 9 ( = (𝑓𝑔) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩))
5349, 52elrnmpt1s 5912 . . . . . . . 8 (((𝑓𝑔) ∈ ran (mRSubst‘𝑇) ∧ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ V) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)))
5447, 48, 53sylancl 586 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)))
551, 2, 3elmsubrn 34122 . . . . . . 7 ran 𝑆 = ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩))
5654, 55eleqtrrdi 2849 . . . . . 6 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran 𝑆)
5746, 56eqeltrd 2838 . . . . 5 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ∈ ran 𝑆)
58 coeq1 5813 . . . . . . 7 (𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) → (𝐹𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ 𝐺))
59 coeq2 5814 . . . . . . 7 (𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ 𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
6058, 59sylan9eq 2796 . . . . . 6 ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
6160eleq1d 2822 . . . . 5 ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → ((𝐹𝐺) ∈ ran 𝑆 ↔ ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ∈ ran 𝑆))
6257, 61syl5ibrcom 246 . . . 4 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆))
6362rexlimivv 3196 . . 3 (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆)
6417, 63sylbir 234 . 2 ((∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆)
6510, 16, 64syl2anb 598 1 ((𝐹 ∈ ran 𝑆𝐺 ∈ ran 𝑆) → (𝐹𝐺) ∈ ran 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  wrex 3073  Vcvv 3445  cop 4592  cmpt 5188   × cxp 5631  ran crn 5634  ccom 5637  wf 6492  cfv 6496  1st c1st 7919  2nd c2nd 7920  mTCcmtc 34058  mRExcmrex 34060  mExcmex 34061  mRSubstcmrsub 34064  mSubstcmsub 34065
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  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
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-nel 3050  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-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-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-er 8648  df-map 8767  df-pm 8768  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-n0 12414  df-xnn0 12486  df-z 12500  df-uz 12764  df-fz 13425  df-fzo 13568  df-seq 13907  df-hash 14231  df-word 14403  df-lsw 14451  df-concat 14459  df-s1 14484  df-substr 14529  df-pfx 14559  df-struct 17019  df-sets 17036  df-slot 17054  df-ndx 17066  df-base 17084  df-ress 17113  df-plusg 17146  df-0g 17323  df-gsum 17324  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-mhm 18601  df-submnd 18602  df-frmd 18659  df-vrmd 18660  df-mrex 34080  df-mex 34081  df-mrsub 34084  df-msub 34085
This theorem is referenced by:  mclsppslem  34177
  Copyright terms: Public domain W3C validator