cdlemk19u1

Description: cdlemk19 with simpler hypotheses. TODO: Clean all this up. (Contributed by NM, 31-Jul-2013)

	Ref	Expression
Hypotheses	cdlemk5.b	$⊢ B = {Base}_{K}$
	cdlemk5.l	$⊢ \underset{˙}{\leq} = \leq_{K}$
	cdlemk5.j	$⊢ \underset{˙}{\lor} = join (K)$
	cdlemk5.m	$⊢ \underset{˙}{\land} = meet (K)$
	cdlemk5.a	$⊢ A = Atoms (K)$
	cdlemk5.h	$⊢ H = LHyp (K)$
	cdlemk5.t	$⊢ T = LTrn (K) (W)$
	cdlemk5.r	$⊢ R = trL (K) (W)$
	cdlemk5.z	$⊢ Z = (P \underset{˙}{\lor} R (b)) \underset{˙}{\land} (N (P) \underset{˙}{\lor} R (b \circ F^{-1}))$
	cdlemk5.y	$⊢ Y = (P \underset{˙}{\lor} R (g)) \underset{˙}{\land} (Z \underset{˙}{\lor} R (g \circ b^{-1}))$
	cdlemk5.x	$⊢ X = (ι z \in T \| \forall b \in T ((b \neq {I ↾}_{B} \land R (b) \neq R (F) \land R (b) \neq R (g)) \to z (P) = Y))$
	cdlemk5.u	$⊢ U = (g \in T ⟼ if (F = N, g, X))$
Assertion	cdlemk19u1	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to U (F) (P) = N (P)$

Proof

Step	Hyp	Ref	Expression
1		cdlemk5.b	$⊢ B = {Base}_{K}$
2		cdlemk5.l	$⊢ \underset{˙}{\leq} = \leq_{K}$
3		cdlemk5.j	$⊢ \underset{˙}{\lor} = join (K)$
4		cdlemk5.m	$⊢ \underset{˙}{\land} = meet (K)$
5		cdlemk5.a	$⊢ A = Atoms (K)$
6		cdlemk5.h	$⊢ H = LHyp (K)$
7		cdlemk5.t	$⊢ T = LTrn (K) (W)$
8		cdlemk5.r	$⊢ R = trL (K) (W)$
9		cdlemk5.z	$⊢ Z = (P \underset{˙}{\lor} R (b)) \underset{˙}{\land} (N (P) \underset{˙}{\lor} R (b \circ F^{-1}))$
10		cdlemk5.y	$⊢ Y = (P \underset{˙}{\lor} R (g)) \underset{˙}{\land} (Z \underset{˙}{\lor} R (g \circ b^{-1}))$
11		cdlemk5.x	$⊢ X = (ι z \in T \| \forall b \in T ((b \neq {I ↾}_{B} \land R (b) \neq R (F) \land R (b) \neq R (g)) \to z (P) = Y))$
12		cdlemk5.u	$⊢ U = (g \in T ⟼ if (F = N, g, X))$
13		simp22	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to F \neq N$
14		simp21	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to F \in T$
15	11 12	cdlemk40f	$⊢ (F \neq N \land F \in T) \to U (F) = ⦋ F / g ⦌ X$
16	13 14 15	syl2anc	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to U (F) = ⦋ F / g ⦌ X$
17	16	fveq1d	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to U (F) (P) = ⦋ F / g ⦌ X (P)$
18		simp1l	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to (K \in HL \land W \in H)$
19		simp23	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to N \in T$
20		simp1r	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to R (F) = R (N)$
21	1 6 7 8	trlnid	$⊢ ((K \in HL \land W \in H) \land (F \in T \land N \in T) \land (F \neq N \land R (F) = R (N))) \to F \neq {I ↾}_{B}$
22	18 14 19 13 20 21	syl122anc	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to F \neq {I ↾}_{B}$
23	14 22 19	3jca	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to (F \in T \land F \neq {I ↾}_{B} \land N \in T)$
24	1 2 3 4 5 6 7 8 9 10 11	cdlemk19x	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq {I ↾}_{B} \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to ⦋ F / g ⦌ X (P) = N (P)$
25	23 24	syld3an2	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to ⦋ F / g ⦌ X (P) = N (P)$
26	17 25	eqtrd	$⊢ (((K \in HL \land W \in H) \land R (F) = R (N)) \land (F \in T \land F \neq N \land N \in T) \land (P \in A \land \neg P \underset{˙}{\leq} W)) \to U (F) (P) = N (P)$

Metamath Proof Explorer

Theorem cdlemk19u1

Proof