Theorem lautco 38666

Description: The composition of two lattice automorphisms is a lattice automorphism. (Contributed by NM, 19-Apr-2013.)

Hypothesis

Ref	Expression
lautco.i	⊢ 𝐼 = (LAut‘𝐾)

Assertion

Ref	Expression
lautco	⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → (𝐹 ∘ 𝐺) ∈ 𝐼)

Proof of Theorem lautco

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2731	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		lautco.i	. . . . 5 ⊢ 𝐼 = (LAut‘𝐾)
3	1, 2	laut1o 38654	. . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
4	3	3adant3 1132	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
5	1, 2	laut1o 38654	. . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐺 ∈ 𝐼) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
6	5	3adant2 1131	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
7		f1oco 6827	. . 3 ⊢ ((𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾)) → (𝐹 ∘ 𝐺):(Base‘𝐾)–1-1-onto→(Base‘𝐾))
8	4, 6, 7	syl2anc 584	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → (𝐹 ∘ 𝐺):(Base‘𝐾)–1-1-onto→(Base‘𝐾))
9		simpl1 1191	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → 𝐾 ∈ 𝑉)
10		simpl2 1192	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → 𝐹 ∈ 𝐼)
11		simpl3 1193	. . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → 𝐺 ∈ 𝐼)
12		simprl 769	. . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → 𝑥 ∈ (Base‘𝐾))
13	1, 2	lautcl 38656	. . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐺 ∈ 𝐼) ∧ 𝑥 ∈ (Base‘𝐾)) → (𝐺‘𝑥) ∈ (Base‘𝐾))
14	9, 11, 12, 13	syl21anc 836	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝐺‘𝑥) ∈ (Base‘𝐾))
15		simprr 771	. . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → 𝑦 ∈ (Base‘𝐾))
16	1, 2	lautcl 38656	. . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐺 ∈ 𝐼) ∧ 𝑦 ∈ (Base‘𝐾)) → (𝐺‘𝑦) ∈ (Base‘𝐾))
17	9, 11, 15, 16	syl21anc 836	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝐺‘𝑦) ∈ (Base‘𝐾))
18		eqid 2731	. . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾)
19	1, 18, 2	lautle 38653	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ ((𝐺‘𝑥) ∈ (Base‘𝐾) ∧ (𝐺‘𝑦) ∈ (Base‘𝐾))) → ((𝐺‘𝑥)(le‘𝐾)(𝐺‘𝑦) ↔ (𝐹‘(𝐺‘𝑥))(le‘𝐾)(𝐹‘(𝐺‘𝑦))))
20	9, 10, 14, 17, 19	syl22anc 837	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → ((𝐺‘𝑥)(le‘𝐾)(𝐺‘𝑦) ↔ (𝐹‘(𝐺‘𝑥))(le‘𝐾)(𝐹‘(𝐺‘𝑦))))
21	1, 18, 2	lautle 38653	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(le‘𝐾)𝑦 ↔ (𝐺‘𝑥)(le‘𝐾)(𝐺‘𝑦)))
22	21	3adantl2 1167	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(le‘𝐾)𝑦 ↔ (𝐺‘𝑥)(le‘𝐾)(𝐺‘𝑦)))
23		f1of 6804	. . . . . . 7 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
24	6, 23	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
25		simpl 483	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → 𝑥 ∈ (Base‘𝐾))
26		fvco3 6960	. . . . . 6 ⊢ ((𝐺:(Base‘𝐾)⟶(Base‘𝐾) ∧ 𝑥 ∈ (Base‘𝐾)) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
27	24, 25, 26	syl2an 596	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
28		simpr 485	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → 𝑦 ∈ (Base‘𝐾))
29		fvco3 6960	. . . . . 6 ⊢ ((𝐺:(Base‘𝐾)⟶(Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
30	24, 28, 29	syl2an 596	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
31	27, 30	breq12d 5138	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (((𝐹 ∘ 𝐺)‘𝑥)(le‘𝐾)((𝐹 ∘ 𝐺)‘𝑦) ↔ (𝐹‘(𝐺‘𝑥))(le‘𝐾)(𝐹‘(𝐺‘𝑦))))
32	20, 22, 31	3bitr4d 310	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(le‘𝐾)𝑦 ↔ ((𝐹 ∘ 𝐺)‘𝑥)(le‘𝐾)((𝐹 ∘ 𝐺)‘𝑦)))
33	32	ralrimivva 3199	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ ((𝐹 ∘ 𝐺)‘𝑥)(le‘𝐾)((𝐹 ∘ 𝐺)‘𝑦)))
34	1, 18, 2	islaut 38652	. . 3 ⊢ (𝐾 ∈ 𝑉 → ((𝐹 ∘ 𝐺) ∈ 𝐼 ↔ ((𝐹 ∘ 𝐺):(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ ((𝐹 ∘ 𝐺)‘𝑥)(le‘𝐾)((𝐹 ∘ 𝐺)‘𝑦)))))
35	34	3ad2ant1 1133	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → ((𝐹 ∘ 𝐺) ∈ 𝐼 ↔ ((𝐹 ∘ 𝐺):(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ ((𝐹 ∘ 𝐺)‘𝑥)(le‘𝐾)((𝐹 ∘ 𝐺)‘𝑦)))))
36	8, 33, 35	mpbir2and 711	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼 ∧ 𝐺 ∈ 𝐼) → (𝐹 ∘ 𝐺) ∈ 𝐼)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3060   class class class wbr 5125   ∘ ccom 5657  ⟶wf 6512  –1-1-onto→wf1o 6515  ‘cfv 6516  Basecbs 17109  lecple 17169  LAutclaut 38554

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 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pow 5340  ax-pr 5404  ax-un 7692

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-map 8789  df-laut 38558

This theorem is referenced by:  ldilco  38685