Metamath Proof Explorer


Theorem cgrtr3and

Description: Deduction form of cgrtr3 . (Contributed by Scott Fenton, 13-Oct-2013)

Ref Expression
Hypotheses cgrtr3and.1 ( 𝜑𝑁 ∈ ℕ )
cgrtr3and.2 ( 𝜑𝐴 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.3 ( 𝜑𝐵 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.4 ( 𝜑𝐶 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.5 ( 𝜑𝐷 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.6 ( 𝜑𝐸 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.7 ( 𝜑𝐹 ∈ ( 𝔼 ‘ 𝑁 ) )
cgrtr3and.8 ( ( 𝜑𝜓 ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ )
cgrtr3and.9 ( ( 𝜑𝜓 ) → ⟨ 𝐶 , 𝐷 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ )
Assertion cgrtr3and ( ( 𝜑𝜓 ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐶 , 𝐷 ⟩ )

Proof

Step Hyp Ref Expression
1 cgrtr3and.1 ( 𝜑𝑁 ∈ ℕ )
2 cgrtr3and.2 ( 𝜑𝐴 ∈ ( 𝔼 ‘ 𝑁 ) )
3 cgrtr3and.3 ( 𝜑𝐵 ∈ ( 𝔼 ‘ 𝑁 ) )
4 cgrtr3and.4 ( 𝜑𝐶 ∈ ( 𝔼 ‘ 𝑁 ) )
5 cgrtr3and.5 ( 𝜑𝐷 ∈ ( 𝔼 ‘ 𝑁 ) )
6 cgrtr3and.6 ( 𝜑𝐸 ∈ ( 𝔼 ‘ 𝑁 ) )
7 cgrtr3and.7 ( 𝜑𝐹 ∈ ( 𝔼 ‘ 𝑁 ) )
8 cgrtr3and.8 ( ( 𝜑𝜓 ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ )
9 cgrtr3and.9 ( ( 𝜑𝜓 ) → ⟨ 𝐶 , 𝐷 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ )
10 cgrtr3 ( ( 𝑁 ∈ ℕ ∧ ( 𝐴 ∈ ( 𝔼 ‘ 𝑁 ) ∧ 𝐵 ∈ ( 𝔼 ‘ 𝑁 ) ∧ 𝐶 ∈ ( 𝔼 ‘ 𝑁 ) ) ∧ ( 𝐷 ∈ ( 𝔼 ‘ 𝑁 ) ∧ 𝐸 ∈ ( 𝔼 ‘ 𝑁 ) ∧ 𝐹 ∈ ( 𝔼 ‘ 𝑁 ) ) ) → ( ( ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ∧ ⟨ 𝐶 , 𝐷 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐶 , 𝐷 ⟩ ) )
11 1 2 3 4 5 6 7 10 syl133anc ( 𝜑 → ( ( ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ∧ ⟨ 𝐶 , 𝐷 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐶 , 𝐷 ⟩ ) )
12 11 adantr ( ( 𝜑𝜓 ) → ( ( ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ∧ ⟨ 𝐶 , 𝐷 ⟩ Cgr ⟨ 𝐸 , 𝐹 ⟩ ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐶 , 𝐷 ⟩ ) )
13 8 9 12 mp2and ( ( 𝜑𝜓 ) → ⟨ 𝐴 , 𝐵 ⟩ Cgr ⟨ 𝐶 , 𝐷 ⟩ )